Paytm Money Software Developer Interview Questions and Answers

JavaScript questions

Arrays, LinkedList basic dsa questions

Q1. Binary Tree 2nd largest node
Ans. 
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
• Perform an in-order traversal of the binary tree

• Keep track of the two largest nodes encountered

• Return the second largest node when traversal is complete
Answered by AI
Add your answer
Q2. Basic web questions
Add your answer

Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree

Q1. DSA ZigZag tree traversal OS Architecture of RAM Types of RAM Difference between compiler and interpreter What is a scheduler What is multithreading Disadvantages of FCFS and how can we use RoundRobin to ...read more
Ans. 
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
• In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.

• We can use a stack or a queue to implement ZigZag tree traversal.

• The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.

• We start with the root node and alternate be...read more
Answered by AI
Add your answer

Easy coding question generally A, B level question of codeforces

Q1. OOPs, DBMS , Computer network and some basics over java
Add your answer