{{ message }}

Instantly share code, notes, and snippets.

# charles gomescharles2588

Created Nov 8, 2019
View testnotebook.ipynb Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Created Jul 7, 2016
https://repl.it/C9dx/0 created by charles2588
View C9dx-0.py
 #Staircase builder n=5 startforhash=n-1 str="" for i in range(n): for j in range(n): if(j>=startforhash): str+="#" else: str+=" "
Created Jul 6, 2016
https://repl.it/C93N/0 created by charles2588
View C93N-0.py
 import random def rand5(): return random.randrange(0,6,1) def rand7(): diff=7-5 x=rand5() if x<=rand5(): return x else: return x+diff
Created Jul 1, 2016
https://repl.it/C8Cl/1 created by charles2588
View Greedy_exceptIndexMutliplier.py
 #Find product of all other numbers in the array for a given index except the number at that index.for ex. [1,2,3] = [6(3*2),3(1*3),2(1*2)] def multiplier(arr): result=[1 for i in arr] #Brute force for i in range(len(arr)): for j in range(len(arr)): if j==i: continue else: result[i]=result[i]*arr[j]
Created Jun 30, 2016
https://repl.it/C7lO/1 created by charles2588
View UnkownArguments.py
 #when you are not aware about number of arguments to a function #args are passed in list def multiplynumbers(*args): count=1 for i in args:count*=i return count print(multiplynumbers(1,2,3,4,5)) #keyword arguments are passed as dict() def addnumbers(**kwargs):
Created Jun 30, 2016
https://repl.it/C75S/4 created by charles2588
View Binary Search.py
 #Binary Search def binarysearch(arr,searchterm): start=0 #we need start and end to calculate pivot end=len(arr)-1 while(start<=end):#when to stop when start and end cross each other pivot=int((start+end)/2) if(arr[pivot])==searchterm: return True elif(arr[pivot]>searchterm): end=pivot-1 #search left when pivot item is bigger
Created Jun 29, 2016
https://repl.it/C7E0/0 created by charles2588
View RecursiveStringReverse.py
 #Recursive way of string reverse def reversestring(str): return str[len(str)-1::-1] def recursivereversestr(str): if len(str)<1: return str else: return recursivereversestr(str[1:])+str print(reversestring("ADCA")) print(recursivereversestr("charles"))
Created Jun 29, 2016
https://repl.it/C7Dk/1 created by charles2588
View recursiveint2stringconvert.py
 #Recursive way to convert integer to string def int2string(num): #Base case: if num<10:##check if it is single digit number return stringlookup(num) else: return int2string(int(num/(10**1)))+stringlookup(int(num%(10**1))) def stringlookup(n): d = {1:"1",2:"2",3:"3",4:"4",5:"5",6:"6",7:"7",8:"8",9:"9",0:"0"} return d[n]
Last active Jun 28, 2016
https://repl.it/C6wn/2 created by charles2588
View Recursive_SumofList.py
 #Calculate the sum of list of numbers def sumoflist(list,count): if len(list)==1:#Escape Clause print(count+list) return count+list else: count+=list sumoflist(list[1:],count) print(sumoflist([1,2,3,4,5],0)) #Wrong way of using recursion above
Created Jun 28, 2016
https://repl.it/C6t6/2 created by charles2588
View AnagramTester.py
 #Test if strings are anagram provided their length is same. def anagramtester(str1,str2): #dictionary=dict(range(0,26)) #CountDict=dict((el,0) for el in str1) CountDictStr1=dict() # i need dictionary to keep count for i in range(len(str1)): if str1[i] in CountDictStr1.keys(): CountDictStr1[str1[i]]+=1 else:
You can’t perform that action at this time.