DeepVision INC Interview Experience SDE-2
Round 1:
- Questions regarding career aspirations and personal interests. Pitched own company and   problem they are trying to solve.
- https://stackoverflow.com/questions/6443569/implementation-of-c-lower-bound
- https://www.geeksforgeeks.org/floor-and-ceil-from-a-bst/
Round 2:
- BFS in network, find first node with property
- DFS : Print all paths to all nodes with property
- https://www.geeksforgeeks.org/find-first-non-repeating-character-stream-characters
Round 3:
- https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string
- https://www.geeksforgeeks.org/inplace-rotate-square-matrix-by-90-degrees
Round 4:
- A version of this:
https://puzzling.stackexchange.com/questions/10839/ant-walking-on-a-number-line
Â
Probability question: ant can go right with probability p and left with 1-p. At each interval, the ant can only 1 step. What is the probability that the ant will remain at the origin at time t=n.Â
Basically find P(x=0| t=N). Ans = (nCn/2) p^(n/2)q^(n/2).
2.Transpose the last 2 dimensions of higher order matrix. Eg: a Matrix of dimension M[200][200][200][200].
Transpose in such a way that M[][][34][97] can be found in M[][][97][34].
- Solve Fibonacci recurrence relation
- Explain Convolutional Neural Network
Round 5:
Hiring Manager Round
Work Culture, Why leaving current Company
Result: Offered
Last Updated :
04 Sep, 2019
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...