PayU Interview Experience (3+ yrs Experienced )

Round 1:

  1. List different sorting algorithms
  2. Time and space complexity of a few sorting algos.
  3. Given an array A[] and a number x, check for pair in A[] with sum as x

Round 2:

  1. Linear vs nonlinear data structures
  2. An example where stacks and queues are used
  3. Implement PQ in java  
  4. Explain the working of hashmap
  5. Is hashmap concurrent and how’s it related to hashtable
  6. Can we have a class with no main
  7. Write an API to do a get on a table.
  8. How to Measure 45 minutes using two identical wires?

Round 3:

  1. Recent Project
  2. About the most interesting thing, I have ever done
  3. Monolith and microservices pros and cons
  4. Count ways to divide circle using N non-intersecting chords
  5. After telling the solution, he asked to code it and mail after the interview.
  6. Design notification system.


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 :
Practice Tags :


Be the First to upvote.


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