Paytm Software Engineer Interview Questions, Process, and Tips

Got an hackerRank test link which consists HTML, CSS, JS, React and DSA question with MCQs.

Q1. JS related discussion.
Add your answer
Q2. DSA question
Add your answer

Q1. React machine coding round
Add your answer
Q2. DSA question
Add your answer

Medium level one coding question

Q1. Question related to project mentioned in resume
Add your answer
Q2. Question related to projects
Add your answer

2 questions in DSA on arrays and linked list

Q1. 1 question on linked list and general discussion
Add your answer

Q1. Questions about realtime problem solving, no coding directly
Add your answer

Q1. LinkedIn List based problems
Ans. 
LinkedIn List based problems involve manipulating linked lists to solve various coding challenges.
• Implement common linked list operations like insertion, deletion, and traversal.

• Solve problems involving reversing a linked list, detecting cycles, or finding the intersection point of two linked lists.

• Use techniques like two pointers, recursion, or hash tables to optimize solutions.
Answered by AI
Add your answer
Q2. Hashing based problems and questions
Add your answer

Q1. Rotate a linked List
Ans. 
Rotate a linked list by k positions
• Traverse the linked list to find the length and the last node

• Connect the last node to the head to make it a circular linked list

• Traverse again to find the new tail node at position length - k % length

• Set the new head as the next node of the new tail and update the new tail's next to null
Answered by AI
Add your answer
Q2. Find the element in rotated sorted array
Ans. 
Use binary search to find the pivot point and then search for the target element in the appropriate half of the array.
• Find the pivot point where the array is rotated

• Use binary search to search for the target element in the appropriate half of the array

• Handle cases where the target element is not found
Answered by AI
Add your answer

Q1. Kth element in a linked list
Ans. 
To find the kth element in a linked list, iterate through the list and return the element at the kth position.
• Iterate through the linked list while keeping track of the current position

• Return the element when the current position equals k

• Handle cases where k is out of bounds or the linked list is empty
Answered by AI
Add your answer
Q2. Level order traversal with alternate order
Ans. 
Level order traversal of a binary tree with alternate order
• Use a queue to perform level order traversal

• Alternate the order of nodes at each level

• Example: For a binary tree with nodes 1, 2, 3, 4, 5, the output could be ['1', '3 2', '4 5']
Answered by AI
Add your answer