Paytm Backend Developer Intern Interview Questions and Answers

They call it a Machine coding round where in a call they will provide you with the problem statement and then give you 90 mins to create an LLD patterns-based working solution in any language you are comfortable with.

2 Coding questions based on graphs and arrays. It was medium to hard leetcode and you need to solve both to proceed to the next round.

Machine Coding round on codesignal

It was a machine coding round which revolves around designing a simple application primarily on OOPS

Q1. Best time to sell stocks
Ans. 
The best time to sell stocks is when the market is high and the stock has reached its peak value.
• Sell when the stock has reached its peak value to maximize profits

• Consider selling if the company's fundamentals have changed negatively

• Sell if you need to rebalance your portfolio or have reached your financial goals
Answered by AI
Add your answer
Q2. Best time to sell stocks 2
Ans. 
The best time to sell stocks is when the market is at a peak and the stock price is high.
• Monitor market trends and stock performance regularly.

• Consider selling when the stock reaches a new high or when you have achieved your profit goals.

• Sell if there are negative news or events that could impact the stock price negatively.
Answered by AI
Add your answer

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

Q1. Self Introduction about yourself
Ans. 
I am a Backend Associate with experience in developing and maintaining server-side applications.
• Proficient in programming languages like Java and Python

• Experience in working with databases like MySQL and MongoDB

• Familiar with RESTful APIs and microservices architecture

• Strong problem-solving and debugging skills

• Ability to work in a team and collaborate effectively
Answered by AI
Add your answer

Q1. How much you know about who's your admire person in your life ?
Ans. 
My admired person in life is my mother.
• My mother has always been my source of inspiration and support.

• She has taught me the values of hard work, perseverance, and kindness.

• Her selflessness and dedication to her family and community are admirable.

• She has overcome numerous challenges and always remains positive.

• I strive to be like her in both my personal and professional life.
Answered by AI
Add your answer

Q1. How much you have experienced, specify about your experience
Ans. 
I have 3 years of experience in backend development.
• 3 years of experience in backend development

• Proficient in programming languages like Java and Python

• Experience with databases like MySQL and MongoDB

• Familiarity with RESTful APIs and web services

• Knowledge of version control systems like Git
Answered by AI
Add your answer

Q1. Do you have all document like your graduation and experience certificate
Ans. 
Yes, I have all the required documents.
• I have my graduation certificate from XYZ University.

• I also have experience certificates from my previous employers.

• I can provide these documents upon request.
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
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