Python Developer was asked...May 26, 2019

↳

num = int(input()) for i in range(num): for j in range(num): print(" ",end=" ") for j in range(num-i): print(" ",end="") for j in range(i+1): print("*",end=" ") print() for i in range(num,0,-1): for j in range(num-i+1): print(" ",end="") for j in range(i): print("*",end=" ") print() Less

↳

with less loops n=int(input()) print(n*"@") for i in range(1,n+2): for j in range(i): print("*",end="") print("") for i in range(n,0,-1): for j in range(i): print("*",end="") print("") print(n*"@") Less

↳

n=int(input()) right=n-1 spaces=4*n-right-2 for i in range(1,n+1): print(spaces*' ',end='') print(i*"* ",end='') print(right*" ") spaces-=1 right-=1 spaces,right=0,0 for i in range(n,0,-1): print(spaces*' ',end='') print(i*"* ",end='') print(right*" ") spaces+=1 right+=1 Less

Python Developer was asked...December 10, 2015

↳

I bet you come from C++? return [x for x in li if li.count(x) == 1]

↳

There's actually an even simpler solution: return set(li)

↳

A=['a', 'b,' a'] Set(a) ['a', 'b']

Python/Django Developer was asked...May 24, 2018

↳

I was only able to do this : * * * @ * * * @ * * @ * @ Less

↳

Please elaborate your question.. How question pattern looks like. It's seems in single line and you printed in multiple lines... thank-you Less

↳

n = int(input("num")) print("* " ) print("* ", end="") print("* ", end="") print("@ ", end="") print("\n") for i in range(n-2, 0, -1): m = n-1-i for j in range(i): print("* " , end="") print("@ ", end="") for k in range(m): print("* ",end="") print("\n") print(" ", end="") print(" ", end="") print("@ ", end="") print("* ", end="") print("* ") for m in range(5): if m<4: print(" ", end="") else: print("* ") Less

Python Developer was asked...October 22, 2020

↳

What were the questions about in the online test and face to face round

↳

Face to face they ask related to DS al

↳

do you remember questions asked in online hackerrank test

Senior Python Developer was asked...April 23, 2016

↳

max([functools.reduce(operator.mul, data[i-4:i]) for i in data if i > 3])

↳

max([functools.reduce(operator.mul, data[i-4:i]) for (i, e) in enumerate(data) if e > 3]) Less

↳

def largest_2str_multipler(a): l = len(a) m = int(a[0])*int(a[1]) for x in range(1,l-1): if m < int(a[x])*int(a[x+1]): m = int(a[x])*int(a[x+1]) return m Less

Python Developer was asked...August 24, 2018

↳

what was the question in your Hackathon round?

↳

Share the questions of hackathon round plz

↳

It will. Be great help if someone can update here questions of Hackathon Or round 3 . Thanks! Less

Python Developer was asked...July 28, 2015

Systems Engineer/Python Developer was asked...June 25, 2015

↳

1.) I said hard to tell because that is a very vague question. 2.) Use grep and awk and wc. 3.) Use the above plus "bc" to calculate percentage. Less

↳

for: 2.) Use grep and awk and wc. I believe grep + uniq + wc would be better and simpler, right? Less

↳

for: 2.) Use grep and awk and wc. 'grep -c' is enough

Senior Python Developer was asked...April 23, 2016

↳

import datetime c = 0 for y in range(1901,2001): for m in range(1,13): d = datetime.datetime(y,m,1) if d.weekday() == 6: c += 1 print('Number of Sundays: ',c) Less

↳

import datetime count=0 for i in range(1901,2001): for j in range(1, 13): if datetime.date(i,j,1).weekday() == 6: count+=1 print(count) Less

↳

Two lines of code in matlab: Answer is 171 sundays fall on the first day of the month from 1 Jan 1901 to 31 Dec 2000 dt = datenum(1901,1,1):datenum(2001,1,1)-1; sum(day(dt(weekday(dt) == 1)) == 1) Less

Senior Python Developer was asked...April 23, 2016

↳

fib = {1:1, 2:1} def calc_fib(n): if n in fib.keys(): return fib[n] else: fib[n]=calc_fib(n-1)+calc_fib(n-2) return fib[n] print(calc_fib(9)) Less

↳

remember how to approximate as N is large

↳

The matlab example sets N = 12 (the 12th fab. number) which happens to be 144. N = 12; f = ones(N,1); for i = 3:N; f(i) = f(i-1) + f(i-2); end; f(end) Less