AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Paytm
Compare
Filter interviews by
Paytm Software Engineer Interview Questions, Process, and Tips
Top Paytm Software Engineer Interview Questions and Answers
- Q1. Puzzle : 100 people are standing in a circle .each one is allowed to shoot a person infront of him and he hands the gun to the next to next person for e.g 1st person kill ...read more
- Q2. Generate Binary Strings with No Consecutive 1s Given an integer K , your task is to produce all binary strings of length 'K' that do not contain consecutive '1's. Input: ...read more
- Q3. Minimum Number of Coins Problem Dora, on her visit to India, decides to enjoy Indian cuisine where payments are accepted only in specific denominations. Your task is to ...read more
Paytm Software Engineer Interview Experiences
51 interviews found
Anonymous
Selected
I applied via Campus Placement and was interviewed before Nov 2022. There were 3 interview rounds.
(1 Question)
- Q1. Coding Stack Question
(1 Question)
- Q1. Kind of mathematical Data structures Question. DBMS question. SQL.
Interview Preparation Tips
I applied via Referral
Interview Questionnaire
4 Questions
- Q1. 1. Find the no of rotations in a rotated sorted array.
- Ans.
Find the number of rotations in a rotated sorted array.
Use binary search to find the minimum element in the array.
The number of rotations is equal to the index of the minimum element.
If the minimum element is at index 0, then there are no rotations.
If the array is not rotated, then the number of rotations is 0.
- Q2. House robber problem from leetcode
- Q3. Modify the given 2×2 matrix in such a way that if a cell contains 0 all the elements of corresponding row and columm becomes 0
- Ans.
Modify a 2x2 matrix to replace row and column with 0 if a cell contains 0.
Iterate through the matrix and find the cells with 0.
Store the row and column index of the cells with 0 in separate arrays.
Iterate through the row and column arrays and replace all elements with 0.
Return the modified matrix.
- Q4. Find the row with max number of vowels in a 2×2 matrix. Given that first element of each row contains a vowel if there are any in the whole row.
- Ans.
Find row with max vowels in 2x2 matrix with first element of each row containing a vowel.
Iterate through each row and count the number of vowels in it.
Keep track of the row with max number of vowels.
If first element of a row is a vowel, start counting from that element.
Example: [['a', 'b'], ['e', 'i']] should return 2nd row.
Interview Preparation Tips
Skills evaluated in this interview
I was interviewed in Nov 2020.
(2 Questions)
Round duration - 70 minutes
Round difficulty - Medium
- Q1.
Subtree of Another Tree Problem Statement
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Explanation:
... - Q2.
Generate Binary Strings with No Consecutive 1s
Given an integer
K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.Input:
The input begins with an integer ...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a data structures round.
- Q1.
Longest Consecutive Sequence Problem Statement
You are provided with an unsorted array/list
ARRofNintegers. Your task is to determine the length of the longest consecutive sequence present in the array... - Q2.
Permutations Problem Statement
Given an array of distinct integers, find all possible permutations of the array.
Explanation:
A permutation is a mathematical way of determining the number of possible ar...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a data structures round.
- Q1.
Subsequence Determination Problem
Your task is to verify if the given string
STR1is a subsequence of the stringSTR2. A subsequence means characters fromSTR2are retained in their original order but som... - Q2.
Minimum Falling Path Sum Problem Statement
Given a square array
VECof integers withNrows andNcolumns, you need to determine the minimum sum of a falling path through this square array. The array has ...
Round duration - 25 minutes
Round difficulty - Easy
This round was all about OS/DBMS questions.
Interview Preparation Tips
Tip 1 : Practice atleast 100-150 Medium problems and 20-30 hard problems from leetcode
Tip 2 : Try to give a short contest maybe on leetcode, codeforces or codechef as it is beneficial to crack in Online Test.
Tip 3 : Do atleast 2 projects and ask find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you an modification in your project.
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Try to keep a single page resume.
Tip 4 : If your CGPA is quite low do not mention it on the resume.
Tip 5 : In achievements sections only add relevant achievements. Putting achievements like "won painting competition" or "won dancing competition" wont help.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
The test was organized online on Amcat and there were 3 coding problems. There were no MCQs in this round.
- Q1.
Ninja Technique Problem Statement
Implement a function that determines whether a given numeric string contains any substring whose integer value equals the product of two consecutive integers. The functio...
- Ans.
Implement a function to determine if a numeric string contains a substring whose value equals the product of two consecutive integers.
Iterate through all substrings of the input string and check if their integer value equals the product of two consecutive integers.
Use nested loops to generate all possible substrings efficiently.
Check if the product of two consecutive integers matches the integer value of the substring.
...
- Q2.
Find Nodes at a Specific Distance from Target in a Binary Tree
Given a binary tree, a target node within this tree, and an integer
K, identify and return all nodes that are exactlyKedges away from the t... - Ans.
Find nodes at a specific distance from a target node in a binary tree.
Traverse the binary tree to find the target node.
Perform a depth-first search to identify nodes at distance K from the target node.
Return the values of nodes found at distance K in an array.
(1 Question)
Round duration - 50 Minutes
Round difficulty - Medium
This round was scheduled by the college Training and Placement team virtually. The interviewer asked me questions pertaining mainly to DSA and we discussed my projects.
- Q1.
Segregate Even and Odd Nodes in a Linked List
You are given the head node of a singly linked list
head. Your task is to modify the linked list so that all the even-valued nodes appear before all the odd-v... - Ans.
Reorder a singly linked list so that all even-valued nodes appear before odd-valued nodes while preserving the original order.
Create two separate linked lists for even and odd nodes
Traverse the original list and move nodes to respective even or odd lists
Merge the even and odd lists while maintaining the original order
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
Again, the round was virtual. This was a Tech + Managerial round organized by the college T & P cell. The interviewer asked questions related to fundamental subjects such as Operating Systems, Object-oriented programming, and DBMS. There was one coding round at the end.
- Q1.
Diagonal Traversal of a Binary Tree
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Example:
Explanation:
Consider lines at a...
- Ans.
Diagonal traversal of a binary tree involves printing nodes at 135 degree angle in between lines.
Traverse the tree in a diagonal manner, starting from the root node.
Maintain a map to store nodes at each diagonal level.
Print the nodes at each diagonal level in the order of traversal.
Round duration - 40 Minutes
Round difficulty - Easy
The round was virtual and was organized by the T & P cell of the college. The interviewer asked some behavioural and situation-based questions. There was one puzzle at the end.
Interview Preparation Tips
Tip 1 : For a product-based company, the first important thing is to solve as many DSA problems as possible. I solved problems mainly on GeeksforGeeks, LeetCode, and Coding Ninjas.
Tip 2 : Prepare 2-3 good projects based on your technical skillset. Prepare it very well as there is a high chance that projects would be discussed in the interview.
Tip 3 : Prepare fundamental college subjects like Operating systems, Object-oriented Programming, Database Management.
Tip 1 : Keep it short and concise
Tip 2 : Describe your projects very specifically
Skills evaluated in this interview
Paytm interview questions for designations
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It was held in the evening around 4 pm. The camera was on during the test to invigilate the activity of students. On any doubtful action, warning was given. Platform was easy to code in.
- Q1.
Replace 0s Problem Statement
You are given a matrix where every element is either a 1 or a 0. The task is to replace 0 with 1 if it is surrounded by 1s. A 0 (or a set of 0s) is considered to be surrounded...
- Q2.
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
- Q3.
Minimum Subset Sum Difference Problem
Given an array of non-negative integers, your task is to partition this array into two subsets such that the absolute difference between the sums of the subsets is mi...
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It was held in the morning around 11:30 am. The interview was scheduled on google meet. The interviewer was quite friendly. He started by a brief introduction. This round was mostly based on Data structures and algorithms. At the end he asked some concepts of OOPs and Operating System.
- Q1.
String Transformation Problem
Given a string (
STR) of lengthN, you are tasked to create a new string through the following method:Select the smallest character from the first
Kcharacters ofSTR, remov... - Q2.
SpecialStack Design Problem
Design a stack that efficiently supports the getMin() operation in O(1) time with O(1) extra space. This stack should include the following operations: push(), pop(), top(), is...
- Q3.
Geometric Progression Subsequences Problem Statement
Given an array of ‘N’ integers, determine the number of subsequences of length 3 that form a geometric progression with a specified common ratio ‘R’.
...
- Q4. What are the conditions for a deadlock to occur?
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
It was held in the afternoon around 3pm. The interviewer was quite friendly. She started with my introduction. She asked 2-3 problems related to data structures and then asked about python libraries which I used in my projects.
- Q1.
Group Anagrams Problem Statement
Given an array or list of strings called
inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth... - Q2.
Kth Smallest Element Problem Statement
You are provided with an array of integers
ARRof sizeNand an integerK. Your task is to find and return theK-th smallest value present in the array. All elements...
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
It was held in the evening around 6 pm. The interviewer started with a brief introduction of me. He asked about my projects and then asked some concepts of Operating System and problems related to data structures. I had projects of Machine Learning and Deep learning. Discussion about projects continued for about 25 minutes.
- Q1.
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Interview Preparation Tips
Tip 1 : Practice problems related to data structures and algorithms
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : You should have a deep knowledge of your projects and related technology.
Tip 1 : It should not be more than a page.
Tip 2 : It should be precise and university projects or prior experience like industrial training or internship should be mentioned.
Skills evaluated in this interview
Get interview-ready with Top Paytm Interview Questions
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Medium
It consisted of three coding questions varying from easy to medium.
- Q1.
Distributing Coins in a Binary Tree
You are provided with the root of a binary tree that consists of 'N' nodes. Each node in this tree contains coins, and the total number of coins across all nodes is equ...
- Ans.
Determine the minimum number of moves required to distribute coins in a binary tree so that every node has exactly one coin.
Traverse the binary tree in a bottom-up manner to distribute coins efficiently.
Keep track of the excess or deficit of coins at each node to calculate the minimum moves required.
Transfer coins from nodes with excess coins to nodes with deficits to balance the distribution.
Example: For the input ROO...
- Q2.
Distinct Subsets Count
Given an array
arrof N integers that may include duplicates, determine the number of subsets of this array containing only distinct elements.The result should be returned modulo ...
- Ans.
Count the number of distinct-element subsets in an array modulo 10^9+7.
Iterate through the array and keep track of distinct elements using a set.
Calculate the number of subsets using the formula 2^distinct_count - 1.
Return the result modulo 10^9+7 for each test case.
- Q3.
0-1 Knapsack Problem Statement
A thief is robbing a store and can carry a maximal weight 'W' in his knapsack. There are 'N' items, where the i-th item has a weight 'wi' and value 'vi'. Consider the maximu...
- Ans.
The 0-1 Knapsack Problem involves maximizing the value of items a thief can steal within a weight limit.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the maximum value that can be achieved at each weight limit.
Iterate through the items and weights to fill the array with optimal values.
Return the maximum value achievable at the given weight limit.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
The interview was focused on data structures as well as computer fundamentals along with puzzles.
- Q1.
Sort an Array in Wave Form
You are given an unsorted array
ARR. Your task is to sort it so that it forms a wave-like array.Input:
The first line contains an integer 'T', the number of test cases.
For ea... - Ans.
Sort an array in wave form where each element is greater than or equal to its adjacent elements.
Iterate through the array and swap adjacent elements to form a wave pattern.
Ensure that the first element is greater than or equal to the second element.
There can be multiple valid wave arrays, so any valid wave array is acceptable.
- Q2.
Reverse a Linked List Problem Statement
You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.
Input:
The first line of input contai... - Ans.
Reverse a given singly linked list by changing the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(3 Questions)
Round duration - 90 minutes
Round difficulty - Easy
The Round was mainly focused on resume+ dsa + system design +computer fundamentals
- Q1.
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5
Stre... - Ans.
Calculate and print the median after each new integer is added to the stream.
Use a min heap to store the larger half of the numbers and a max heap to store the smaller half.
Keep the two heaps balanced by ensuring the size difference is at most 1.
If the total number of elements is odd, the median is the top of the larger heap. If even, average the tops of both heaps.
- Q2. Can you explain the implementation of an LRU (Least Recently Used) Cache in a database management system?
- Ans.
LRU cache in a database management system stores most recently used data and removes least recently used data when full.
LRU cache is implemented using a doubly linked list and a hash map.
Each node in the linked list represents a key-value pair.
When a key is accessed, it is moved to the front of the linked list.
If the cache is full, the least recently used node at the end of the list is removed.
Example: If cache size is...
- Q3. Design a stack that supports the getMin() operation in O(1) time and O(1) extra space.
- Ans.
Use two stacks - one to store actual values and one to store minimum values.
Use two stacks - one to store actual values and one to store minimum values
When pushing a new value, check if it is smaller than the current minimum and push it to the min stack if so
When popping a value, check if it is the current minimum and pop from min stack if so
getMin() operation can be done by peeking at the top of the min stack
Interview Preparation Tips
Tip 1 : Properly grasp over basic concepts
Tip 2 : Prepare good for DS & Algo as most companies have a separate round for it.
Tip 3 : Don't lie over your resume
Tip 1 : Don't Lie over your resume
Tip 2 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Skills evaluated in this interview
Interview Questionnaire
2 Questions
- Q1. What is solid principles
- Ans.
SOLID principles are a set of five design principles for writing maintainable and scalable code.
S - Single Responsibility Principle
O - Open/Closed Principle
L - Liskov Substitution Principle
I - Interface Segregation Principle
D - Dependency Inversion Principle
- Q2. What are internal working of has set
- Ans.
HashSet is a collection that stores unique elements by using a hash table.
Elements are stored based on their hash code
Uses hashCode() and equals() methods to check for duplicates
Does not maintain insertion order
Allows null values
Example: HashSet
set = new HashSet<>(); set.add("apple"); set.add("banana");
Skills evaluated in this interview
I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.
I dont remember exact questions but they are like leetcode easy and medium
(2 Questions)
- Q1. How web/internet works?
- Ans.
The web/internet is a network of interconnected devices that communicate through standardized protocols to share information.
Devices connect to the internet through ISPs
Data is transmitted through packets using TCP/IP protocols
Web browsers use HTTP/HTTPS protocols to request and receive web pages
DNS servers translate domain names to IP addresses
Web servers host web pages and respond to requests
Search engines use web cr
- Q2. Coding questions with complete explanation
(1 Question)
- Q1. Coding and managerial round similar to round 2
Interview Preparation Tips
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result
Interview Preparation Tips
Aishwarya Gupta
Interview Questionnaire
32 Questions
- Q1. Discussion on the rectangular board question asked in prev round
- Q2. How will you implement a shuffle function for a playlist of songs
- Ans.
Implementing a shuffle function for a playlist of songs
Create a new empty playlist
Randomly select a song from the original playlist and add it to the new playlist
Remove the selected song from the original playlist
Repeat until all songs have been added to the new playlist
Return the new shuffled playlist
- Q3. What is memory leak?
- Ans.
Memory leak is a situation where a program fails to release memory it no longer needs.
Memory leaks can cause a program to consume more and more memory over time, eventually leading to crashes or other issues.
Memory leaks can be caused by programming errors such as not freeing memory after it is no longer needed.
Tools like valgrind can be used to detect memory leaks in C and C++ programs.
Examples of memory leaks include...
- Q4. What is the problem with arrays?
- Ans.
Arrays have fixed size and can lead to memory wastage and performance issues.
Arrays have a fixed size and cannot be resized dynamically.
Inserting or deleting elements in an array can be time-consuming.
Arrays can lead to memory wastage if they are not fully utilized.
Arrays can cause performance issues if they are too large and need to be traversed frequently.
Arrays can also be prone to buffer overflow attacks.
Example: A...
- Q5. Write a function in javascript to hide text on mouse click
- Ans.
Function to hide text on mouse click in JavaScript
Create a function that takes an element as input
Add an event listener to the element for a mouse click
Toggle the element's display property between 'none' and its original value
- Q6. A unsorted array was given and a number x.find out the two elements whose sum is equal to x
- Ans.
Find two elements in an unsorted array whose sum is equal to a given number x.
Use a hash table to store the difference between x and each element in the array.
Iterate through the array and check if the current element is in the hash table.
Return the pair of elements that add up to x.
- Q7. More questions on basic OS concepts related to storage, memory
- Q8. Puzzle : -----/
- Q9. What is BST ?
- Ans.
BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.
BST is a tree-like data structure where each node has at most two children.
The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.
BST allows for efficient searching and sorting operations with a time complexity of O(log n).
Examples of a...
- Q10. How many BSTs are possible with two nodes and three nodes?
- Ans.
Number of possible BSTs with 2 and 3 nodes.
For 2 nodes, only 2 BSTs are possible.
For 3 nodes, 5 BSTs are possible.
Number of BSTs can be calculated using Catalan numbers formula.
Catalan(2) = 2, Catalan(3) = 5.
- Q11. How many trees are possible with two and three nodes?
- Ans.
Answering the question about possible trees with two and three nodes.
For two nodes, there is only one possible tree.
For three nodes, there are three possible trees.
The formula for calculating the number of possible trees with n nodes is (2n-3)!!.
The double exclamation mark represents the double factorial function.
The double factorial function is defined as n!! = n(n-2)(n-4)...(1 or 2).
- Q12. Puzzle : 100 people are standing in a circle .each one is allowed to shoot a person infront of him and he hands the gun to the next to next person for e.g 1st person kills 2nd and hands gun to 3rd .This c...
- Q13. What is indexing? Why it is used?
- Ans.
Indexing is the process of creating an index for faster data retrieval. It is used to improve search performance.
Indexing creates a data structure that allows for faster searching and sorting of data.
It is commonly used in databases to improve query performance.
Examples of indexing include B-trees, hash indexes, and bitmap indexes.
Without indexing, searching through large amounts of data can be slow and inefficient.
- Q14. What are B+ trees?what is the advantage?
- Ans.
B+ trees are balanced trees used for indexing and searching large amounts of data.
B+ trees are similar to binary search trees but have multiple keys per node.
They are commonly used in databases and file systems.
B+ trees have a high fanout, reducing the number of disk accesses required for searching.
They are also self-balancing, ensuring efficient performance even with large amounts of data.
Example: In a database, a B+ ...
- Q15. Any questions you want to ask?
- Ans.
Yes, I have a few questions.
Can you tell me more about the team I'll be working with?
What is the company culture like?
What are the biggest challenges the team is currently facing?
Can you walk me through the development process for a typical project?
What opportunities are there for professional growth and development?
- Q16. Asked me about the skills i have mentioned in my resume
- Q17. Which data structure i like?
- Ans.
I prefer hash tables for their constant time lookup and insertion.
Hash tables are efficient for storing and retrieving data.
They have constant time complexity for both insertion and lookup.
They can be implemented using arrays or linked lists.
Examples include Python's dictionary and Java's HashMap.
- Q18. Can you implement a stack using queue
- Ans.
Yes, we can implement a stack using two queues.
Push operation: Enqueue the element to the first queue.
Pop operation: Dequeue all elements from the first queue and enqueue them to the second queue until the last element. Dequeue and return the last element. Swap the names of the queues.
Top operation: Same as pop operation but don't dequeue the last element.
Example: Push 1, 2, 3. Queue 1: 1 2 3. Queue 2: empty. Pop opera...
- Q19. Two arrays of arrival time of trains and departure time of trains were given. find the minimum no of platforms require so that no collision occurs
- Ans.
Find minimum no of platforms required to avoid collision between trains based on their arrival and departure times.
Sort both arrays in ascending order
Initialize platform count and max count to 1
Loop through both arrays and compare arrival and departure times
If arrival time is less than or equal to departure time, increment platform count
Else, decrement platform count
Update max count if platform count is greater than ma
- Q20. What is JVM ? Difference between JVM and compiler
- Ans.
JVM stands for Java Virtual Machine. It is an abstract machine that provides a runtime environment for Java programs.
JVM is responsible for interpreting the compiled Java code and executing it.
It provides platform independence by converting bytecode into machine-specific code.
JVM has various components like class loader, bytecode verifier, and execution engine.
Compiler converts source code into bytecode, while JVM exec...
- Q21. He asked me to write a html code for a page design he gave
- Q22. He asked me to write a query for a relational schema and problem statement given by him
- Q23. Tell me about Yourself
- Ans.
I am a software engineer with experience in developing web applications and a passion for learning new technologies.
Experienced in developing web applications using technologies such as Java, Spring, and Angular
Passionate about learning new technologies and keeping up with industry trends
Strong problem-solving skills and ability to work in a team environment
Completed a Bachelor's degree in Computer Science from XYZ Uni
- Q24. She asked me if i was nervous
- Q25. What do i know about PayTM ?
- Ans.
PayTM is an Indian e-commerce payment system and digital wallet company.
PayTM was founded in 2010 by Vijay Shekhar Sharma.
It started as a mobile recharge and bill payment platform.
PayTM has expanded to offer services like online shopping, movie ticket booking, and travel bookings.
It also offers a digital wallet that can be used to pay for various services and products.
PayTM has over 350 million registered users and is ...
- Q26. Any feature i would like to add in PayTM app?
- Ans.
I would like to add a feature for splitting bills among friends.
The feature would allow users to split bills for movies, dinners, etc.
Users can select friends from their contact list and split the bill equally or unequally.
The app would send a notification to the selected friends to pay their share.
The feature would make it easier for users to split expenses and avoid awkward conversations.
It would also encourage more
- Q27. What is my favourite app and any improvements in it which i want to implement?
- Ans.
My favourite app is Spotify. I would like to see improvements in the algorithm for personalized playlists.
Improved algorithm for personalized playlists
Better integration with social media platforms
Option to create collaborative playlists with friends
- Q28. She asked me about my school and which school i like the most and why?
- Q29. She asked me about my family
- Q30. What is my favourite subject?
- Ans.
My favourite subject is Computer Science.
I enjoy programming and problem-solving.
I find algorithms and data structures fascinating.
I am interested in artificial intelligence and machine learning.
I like learning about new technologies and keeping up with industry trends.
- Q31. Have i ever been to delhi?
- Q32. Why do I choose NIT Hamirpur? what do i like about Hamirpur?
- Ans.
I choose NIT Hamirpur because of its excellent academic reputation and beautiful campus.
NIT Hamirpur has a strong focus on academics and research, which aligns with my career goals.
The campus is located in a serene and picturesque location, which provides a conducive environment for learning.
The faculty members are highly experienced and knowledgeable, and are always willing to help students.
The college has state-of-th...
Interview Preparation Tips
Experience: General aptitude was easy.It was of 30 mins.
Next technical aptitude and coding questions were of 50 mins duration.
Technical aptitude questions were from OS,C,C++,DBMS.Questions were based on basic concepts.
There were 3 coding questions.
1.A girl eat fish of exact length of 10.She can cut the fish to get the desired length.An array of lengths of fish and maximum possible cuts allowed were given.Find out the max number of fish the girl can eat.
2. A 2-D rectangular board which contains sand grains : 'o' ,obstacles: 'x' and empty cells : '.' .The board is kept vertical. The sand grain can move down into and empty cell but it cannot cross obstacle. find out the final position of all sand grains in the board.
3.It was question on subsequence .
Tips: Just keep your basic concepts clear. Practice questions on strings,dynamic programming and recursion.Go through Geeksforgeeks .It'll help you a lot.
Duration: 80mins minutes
Total Questions: 50
Round: Technical Interview
Experience: The interviewer was very calm and polite. He was giving me hints and enough time to solve the questions.
Tips: Keep talking with the interviewer .Discuss your approach. Do take hints they give you.
Round: Technical Interview
Experience: I was stuck in one or two questions but they keep giving me hints. Interviewers were very nice. They were asking me the approach for each question. They were very cool.
Tips: Stay calm and go ahead. Apply whatever basic knowledge you have . keep asking doubts for the questions if you have any.
Round: Technical Interview
Experience: He asked me about my projects. What was my role. It was an hour long round. Enough time was given to solve each question.I was asked to write code with minimum complexity.
Tips: Keep discussing the questions. Try to reach to the best approach .keep smiling.Never fake your resume.
Round: HR Interview
Experience: The HR was very polite.I was a bit nervous at first but then I was relaxed.
Tips: Just be yourself .You are almost done when you are selected for HR. :) Keep Smiling and be confident about what ever you say.
General Tips: Be confident and have clear basic concepts of all subjects.
Skill Tips: Practise as many questions as you can on geeksforgeeks.
Skills: Coding skills, Logical skills, Aptitude, Basic Knowledge of DBMS
College Name: NIT Hamirpur
Motivation: My recent project work related to E-commerce and the reputation and ecstatic growth of the company in recent months.
Funny Moments: after one of the technical round , interviewer asked me if i had any questions about the company.I asked them what kind of rewards will be given .. do you guys go for trips and get any free coupons :P
Skills evaluated in this interview
Paytm Interview FAQs
Some of the top questions asked at the Paytm Software Engineer interview -
The duration of Paytm Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Paytm Interviews By Designations
- Paytm Software Engineer Interview Questions
- Paytm Team Lead Interview Questions
- Paytm Senior Software Engineer Interview Questions
- Paytm Software Developer Interview Questions
- Paytm Sales Executive Interview Questions
- Paytm Field Sales Executive Interview Questions
- Paytm Key Account Manager Interview Questions
- Paytm Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Developer Intern Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Paytm Software Engineer Interview Process
based on 40 interviews
4 Interview rounds
- Coding Test Round
- Technical Round - 1
- Technical Round - 2
- HR Round
Top Skills for Paytm Software Engineer
Software Engineer Interview Questions from Similar Companies
Fast track your campus placements
Paytm Software Engineer Reviews and Ratings
based on 178 reviews
Rating in categories
|
Team Lead
2.3k
salaries
|  ₹2.5 L/yr - ₹11.4 L/yr |
|
Software Engineer
1.4k
salaries
| ₹6 L/yr - ₹23 L/yr |
|
Senior Software Engineer
1.4k
salaries
| ₹10 L/yr - ₹40 L/yr |
|
Sales Executive
974
salaries
| ₹1 L/yr - ₹6.4 L/yr |
|
Senior Associate
912
salaries
| ₹2.2 L/yr - ₹8.4 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik
- Home >
- Interviews >
- Paytm Interview Questions >
- Paytm Software Engineer Interview Questions
