## JP Morgan Interview Question for Software Engineer / Developers

Country: United States
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````def factorial(n):
if n<2:
return n
else:
return n*factorial(n-1)``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

def fact(n):
if n==1:
return n
else:
return n*fact(n-1)

X=fact(4)
print X

Comment hidden because of low score. Click to expand.
0
of 0 vote

def fact(n):
if n==1:
return n
else:
return n*fact(n-1)

X=fact(4)
print X

Comment hidden because of low score. Click to expand.
0
of 0 vote

#!/usr/bin/python

#define a recursive function for factorials
def re_factorials(n):
if n == 1:
return n
else:
return n*re_factorials(n-1)

input=int(raw_input("Enter the number"))
print "factorials of number %d :- %d" %(input,re_factorials(input))

Comment hidden because of low score. Click to expand.
0
of 0 vote

#!/usr/bin/python

#define a recursive function for factorials
def re_factorials(n):
if n == 1:
return n
else:
return n*re_factorials(n-1)

input=int(raw_input("Enter the number"))
print "factorials of number %d :- %d" %(input,re_factorials(input))

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````def factorial(n):
sum = 0
if n == 0:
return 0
else:
return n*f(n-1)
print factorial(4)``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````def recursive_factorial(n):
if n ==1:
return n
else:
return n*recursive_factorial(n-1)``````

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.