DeepVision INC Interview Experience SDE-2

Round 1:

  1. Questions regarding career aspirations and personal interests. Pitched own company and     problem they are trying to solve.
  2. https://stackoverflow.com/questions/6443569/implementation-of-c-lower-bound
  3. https://www.geeksforgeeks.org/floor-and-ceil-from-a-bst/

Round 2:

  1. BFS in network, find first node with property
  2. DFS : Print all paths to all nodes with property
  3. https://www.geeksforgeeks.org/find-first-non-repeating-character-stream-characters

 

Round 3:

  1. https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string
  2. https://www.geeksforgeeks.org/inplace-rotate-square-matrix-by-90-degrees

 

Round 4:

  1. 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].

    1. Solve Fibonacci recurrence relation
    2. Explain Convolutional Neural Network

     

    Round 5:

    Hiring Manager Round

    Work Culture, Why leaving current Company

     

    Result: Offered

    Write your Interview Experience or mail it to contribute@geeksforgeeks.org




    My Personal Notes arrow_drop_up

    If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

    Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


    Article Tags :

    Be the First to upvote.


    Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.