Skip to content
Related Articles
Open in App
Not now

Related Articles

Paytm Interview Experience | Set 5 (Recruitment Drive)

Improve Article
Save Article
Like Article
  • Difficulty Level : Medium
  • Last Updated : 28 May, 2019
Improve Article
Save Article
Like Article

I attended a Paytm recruitment drive.

The requirement was for both Front-end and Backend Developers. I applied for Backend.

First there was a written round. The paper consists of 4 Sections.

  1. C programming and Data structure objective questions.
  2. Aptitude
  3. Java / Node JS
  4. Subjective programming Question

Subjective questions were

  1. Print all interleavings of given two strings
  2. Largest subarray with equal number of 0s and 1s

After the written round I went through 2 interviews.

First interviewer asked me 3 algorithm questions.

  1. Segregate 0s and 1s in an array
  2. Extended the above question to Sort an array of 0s, 1s and 2s
  3. There are 3 operation available.
    1. Subtract 1
    2. Divide by 2(applicable only when number is divisible by 2)
    3. Divide by 3(applicable only when number is divisible by 3)

    Give the minimum number of operation requires to reduce the number to 1.

Second Interviewer asked only 1 question.

  1. Recursively remove all adjacent duplicates in an array containing numbers.

That’s’ it…!!!!!!!!

Thanks, GeeksforGeeks.

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

My Personal Notes arrow_drop_up
Like Article
Save Article
Related Articles

Start Your Coding Journey Now!