CareerCup

Python Solution:

import random

def randnum(n):
    x = random.randint(0,9)
    if x==n:
        return randnum(n)
    return x
curr = 0
num = 0
for a in xrange(0,4):
    randomNum = randnum(curr)
    curr = randomNum
    num = num*10+randomNum
print num

Python Code :

a = [2,3,5,3,7,9,5,3,7]
b = {i : a.count(i) for i in set(a) }
c= sorted(b.items())
c = sorted(c,key=lambda x:x[1],reverse=1)
out = []
for p,q in c:
	for i in xrange(q):
		out.append(p)
print out

Python Solution :

k = 3
a = [1,2,3,4,1]
bucket = []
for i in xrange(k):
	bucket.append([])
currSum  = 0
for i,num in enumerate(a):
	currSum += num
	bucket[currSum%k].append(i)
total = 0
for i  in xrange(len(bucket)):
	if i == 0:
		total+= (len(bucket[0]) * (len(bucket[i]) +1))/2
	else:
		total += (len(bucket[i]) * (len(bucket[i]) -1) )/ 2
print total

Python Solution :

def isomorpheous(a,b):
	if len(a) != len(b):
		return False
	dicti = {}
	for i in xrange(len(a)):
		if a[i] in dicti:
			if b[i] != dicti[a[i]]:
				return False
		else:
			dicti[a[i]] = b[i]

	if len( dicti.values()) != len(set(dicti.values())):
		return False
	return True
		

print isomorpheous("abcd","zxyz")

Python solution :

import numpy as np
a = [-1,3,5,2,-2,-2,-4,4,-1,-199,10,-2131]
b = np.zeros(len(a)-1)
for i in xrange(len(a)-1):
	b[i] = a[i]+a[i+1]
currmax = 0
totalmax = 0

for i in a:
	currmax += i
	if currmax < 0:
		currmax = 0
		flag = 0
	else:
		flag += 1
	if currmax > totalmax and flag >=2:
		totalmax = currmax

if totalmax==0:
	print max(b)
else:
	print totalmax

Python implementation :

words = [1, 2, 1, 0, 5, 2, 4, 2, 3, 0, 1, 3, 2, ]
a = {i:words.count(i) for i in set(words)}
print sorted(a , key=a.get,reverse=1)