Paytm Money Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with 2 DSA problems.

Q1. Detect cycle in undirected graph
You have been given an undirected graph with 'N' vertices and 'M' edges. The vertices are labelled from 1 to 'N'.
Your task is to find if the grap...read more
Ans. 
DFS can be used to detect cycle in an undirected graph. Do a DFS traversal of the given graph. For every visited vertex ‘v’, if there is an adjacent ‘u’ such that u is already visited and u is not parent of v, then there is a cycle in graph.
If we don’t find such an adjacent for any vertex, we say that there is no cycle.
Pseudocode :
 
DetectCycle(graph, v, visited[], parent)
{
	// mark the current node as visited
...read more
Answered by CodingNinjas
View 3 more answers
Q2. Zig-Zag Tree Traversal
Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from left to right, then right to left for th...read more
Ans. 
This problem can be solved using two stacks.
Assume the two stacks are current: currentlevel and nextlevel. We would also need a variable to keep track of the current level order(whether it is left to right or right to left). We pop from the currentlevel stack and print the nodes value. Whenever the current level order is from left to right, push the nodes left child, then its right child to the stack nextlevel. 
Si...read more
Answered by CodingNinjas
View 1 more answer

Hackerrank kind of coding test. 2 questions to resolved within 70mins.

Q1. System Design and data structure.
Add your answer

Q1. System Design and data structure.
Add your answer

Q1. System Design and Data structure.
Add your answer

Just basic mathematics questions.

Q1. Have your own system
Add your answer
Q2. Will youbwork in rotational shifts
Add your answer