# Paytm Interview Experience for Software Engineer| On-Campus

• Difficulty Level : Medium
• Last Updated : 03 Sep, 2021

Round 1: Coding Round (Cocubes Platform)

Time: 70 minutes

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

1. Find the last non-zero digit of a factorial: https://www.geeksforgeeks.org/last-non-zero-digit-factorial/
2. Find in order successor in a binary tree (Non-BST) https://www.geeksforgeeks.org/inorder-succesor-node-binary-tree/
3. Find the minimum index (i, i) in the matrix where either (row is filled with 0s and column with 1s) OR (column is filled with 0s and row with 1s ), except for the element at index (i, i) which can be either 0 or 1.
```Eg:    1 1 0 0
0 1 0 0
1 1 1 1
0 1 0 0```
• For the above matrix, the output will be 1, as (1, 1) is the minimum index where the row is filled with 0s and the column with 1s. Value at (1, 1) can be either 0 or 1.

Round 2: Interview Round 1

Time: 45 minutes

1. Tell me something about yourself, how is life at college?
2. Check if a triplet exists in array such that, i < j < k and ar[ i ] < ar[ k ] && ar[ k ] > ar[ j ],
3. Find the similar problem here https://www.geeksforgeeks.org/find-number-of-triplets-in-array-such-that-aiajak-and-ijk/
4. Given an array, find the maximum for each subarray of length k.
5. https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/
6. What is polymorphism
7. Can constructor be overridden in java, explain with reason
8. What is overriding, explaining with example

Round 3: Interview Round 2

Time:  35 minutes

2. find the middle node of the linked list in a single traversal
3. print all leaf nodes of a binary tree
4. Long discussion on the project – 15 minutes
5. Videos on youtube begin where you left them previous time, how is this implemented?
6. Given a video id and its subtitles (with their start and end time), how will you store them?

After three hours I got a phone call from HR.

Round 4: HR Round (Phone call)

Time: 6 minutes

1. Introduce yourself