Paytm Back end Executive Interview Questions and Answers

Q1. Five advantages of spring boot Which java version you currently use? Features of the java version you use Output from the code Difference between this and super In order to update the string, which will be...read more
Ans. 
Spring Boot offers advantages like rapid development, easy configuration, embedded servers, production-ready features, and more.
• Rapid development: Spring Boot simplifies the setup and configuration of Spring applications, allowing developers to focus on writing business logic.

• Easy configuration: Spring Boot provides auto-configuration, reducing the need for manual setup and boilerplate code.

• Embedded servers: Spring Boo...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with 2 DSA problems.

Q1. 
Detect Cycle in Undirected Graph Problem Statement
You are provided with an undirected graph composed of 'N' vertices and 'M' edges, where vertices are labeled from 1 to 'N'.
Your task is to determine if...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 Anonymously
Add your answer
Q2. 
Zig-Zag Level Order Traversal of Binary Tree
Given a binary tree, your task is to perform a zigzag level order traversal. This traversal starts from left to right on the first level, then switches to righ...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 Anonymously
Add your answer