Add office photos
i
Paytm
Compare
Filter interviews by
Paytm Software Developer Intern Interview Questions, Process, and Tips for Freshers
Top Paytm Software Developer Intern Interview Questions and Answers for Freshers
- Q1. Parth And His OCD Parth is a nerd programmer. He has started learning array/list programming. Parth has received an array/list ‘ARR’ of ‘N’ positive integers as a gift. P ...read more
- Q2. Buy and Sell Stock You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can on ...read more
- Q3. Diameter of the binary tree. You are given a Binary Tree. You are supposed to return the length of the diameter of the tree. The diameter of a binary tree is the length o ...read more
Paytm Software Developer Intern Interview Experiences for Freshers
4 interviews found
CodingNinjas
I was interviewed in Feb 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Diameter of the binary tree.
You are given a Binary Tree. You are supposed to return the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path between any tw...
- Ans. Recursion
The basic idea of this approach is to break the problem into subproblems.
Now, there are three possible cases:
- The diameter of the tree is present in the left subtree.
- The diameter of the tree is present in the right subtree.
- The diameter of the tree passes through the root node.
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...
- Q2. Two Sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use th... - Ans. Hashing Solution
- We can store the frequency of every element in the array in a hashmap.
- We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
- If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
- Else, if the frequency of ARR[i] and Targ...
(2 Questions)
Round duration - 35 minutes
Round difficulty - Medium
The nature of the interviewer was very kind, helped me when I stuck. The round was proctored, our webcam and mic were on, and shared my screen.
- Q1. Basic Interview Questions
Although it was an HR round but this question was quite a mix of tech+HR round. Some puzzles and guesstimates were asked.
- Q2. How to measure 45 mins exactly using a stick that burns completely in 60 mins if burnt from one side.
If we light a stick, it takes 60 minutes to burn completely. What if we light the stick from both sides?...
Interview Preparation Tips
Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP
Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.
Skills evaluated in this interview
I was interviewed in Dec 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Easy
- Q1. Parth And His OCD
Parth is a nerd programmer. He has started learning array/list programming. Parth has received an array/list ‘ARR’ of ‘N’ positive integers as a gift. Parth’s OCD gets triggered every tim...
- Ans. Brute Force
The basic idea of this approach is to iterate the whole ‘ARR’ from start and see if the element present at the current position satisfies the conditions or not. If the element at the current index is not as per requirement then we will find an element which can take that position from ‘ARR’ after that index and replace it with the current element.
Here is the algorithm:
- Run a loop for ‘i’ = 0...
- Q2. Find all occurrences
You are given a 'M' x 'N' matrix of characters, 'CHARACTER_MATRIX' and a string 'WORD'. Your task is to find and print all occurrences of the string in ...
- Ans. DFS
We can use DFS to solve this problem. The idea is to start from each cell in the matrix and explore all eight paths possible and recursively check if they will lead to the solution or not. To make sure that the path is simple and doesn’t contain any cycles, we keep track of cells involved in the current path and before exploring any cell, we ignore it if it is already covered in the current path.
We can f...
- Q3. Print Nodes at distance K from a given node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...
- Ans. DFS
- Create a map to store the parent of each node in the tree, Traverse the tree recursively (via depth-first search), at each step if the current node is not NULL. Store its parent in the map, then traverse the left and right subtree.
- Now assume that the given node is the root of the tree. In such a case, we can simply run a breadth-first search from the root, and track the current level of the tree. When the level = ‘K...
(2 Questions)
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Diagonal Traversal of a binary tree.
You have been given a binary tree of integers. You are supposed to find the diagonal traversal(refer to Example) of the given binary tree.
Example:
Consider lines at... - Ans. Map based approach
The idea is to use the Map to store all the nodes of a particular diagonal number. We will use preorder traversal to update the Map. The key of the Map will be the diagonal number and the value of the Map will be an array/list that will store all nodes belonging to that diagonal.
The steps are as follows:
- Assign the diagonal number of the root as 0.
- Do a preorder traversal of the binary...
- Q2. Diameter of the binary tree.
You are given a Binary Tree. You are supposed to return the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path between any tw...
- Ans. Recursion
The basic idea of this approach is to break the problem into subproblems.
Now, there are three possible cases:
- The diameter of the tree is present in the left subtree.
- The diameter of the tree is present in the right subtree.
- The diameter of the tree passes through the root node.
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...
(2 Questions)
Round duration - 50 minutes
Round difficulty - Medium
The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...
- Ans. Brute Force
For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.
Space Complexity: O(1)Explanation:O(1)
No extra space is used.
Time Complexity: O(n^2)Explanation:O(N ^ 2), Where N is the number of elements ...
- Q2. Subset Sum Equal To K
You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.
Note: Return true if ...
- Ans. Recursion
The idea is to generate all possible subsets and check if any of them sums up to ‘K’. This can be done through recursion.
Here is the algorithm:
subsetSumToK(N , K , ARR):
- Initialize integer variable ‘ANS’ = ‘helper(ARR, N, K)’. Here ‘helper’ is the recursive function that returns true/false.
- If ‘ANS’ is equal to 1 then:
- Return true.
- Else:
- Return false.
helper(ARR, N, K):
- Base case: If ‘N’ is less tha...
(3 Questions)
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Buy and Sell Stock
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....
- Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
Below is the detailed algorithm:
- Call ...
- Q2. DBMS Questions
SQL command
ACID properties
Difference between unique primary and foreign key. - Q3. OS Questions
What is segementation.
Difference between internal and external fragmentation.
Interview Preparation Tips
Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP
Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.
Skills evaluated in this interview
I was interviewed in Dec 2020.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Diagonal Traversal of a binary tree.
You have been given a binary tree of integers. You are supposed to find the diagonal traversal(refer to Example) of the given binary tree.
Example:
Consider lines at... - Ans. Map based approach
The idea is to use the Map to store all the nodes of a particular diagonal number. We will use preorder traversal to update the Map. The key of the Map will be the diagonal number and the value of the Map will be an array/list that will store all nodes belonging to that diagonal.
The steps are as follows:
- Assign the diagonal number of the root as 0.
- Do a preorder traversal of the binary...
- Q2. Diameter Of Binary Tree
You are given a Binary Tree. You are supposed to return the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path between any two end...
- Ans. Recursion
The basic idea of this approach is to break the problem into subproblems.
Now, there are three possible cases:
- The diameter of the tree is present in the left subtree.
- The diameter of the tree is present in the right subtree.
- The diameter of the tree passes through the root node.
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Medium
The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...
- Ans. Brute Force
For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.
Space Complexity: O(1)Explanation:O(1)
No extra space is used.
Time Complexity: O(n^2)Explanation:O(N ^ 2), Where N is the number of elements ...
- Q2. Subset Sum Equal To K
You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.
Note: Return true if ...
- Ans. Recursion
The idea is to generate all possible subsets and check if any of them sums up to ‘K’. This can be done through recursion.
Here is the algorithm:
subsetSumToK(N , K , ARR):
- Initialize integer variable ‘ANS’ = ‘helper(ARR, N, K)’. Here ‘helper’ is the recursive function that returns true/false.
- If ‘ANS’ is equal to 1 then:
- Return true.
- Else:
- Return false.
helper(ARR, N, K):
- Base case: If ‘N’ is less tha...
(3 Questions)
Round duration - 45 Minutes
Round difficulty - Medium
The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Buy and Sell Stock
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....
- Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
Below is the detailed algorithm:
- Call ...
- Q2. DBMS Questions
SQL command
ACID properties
Difference between unique primary and foreign key. - Q3. OS Questions
What is segementation.
Difference between internal and external fragmentation.
Interview Preparation Tips
Tip 1 : Do at least 1 projects at any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP
Tip 1 : At least mention the projects or internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.
Skills evaluated in this interview
What people are saying about Paytm
I was interviewed in Dec 2020.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Coding round with 3 coding questions.
- Q1. Print Nodes at distance K from a given node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...
- Ans. DFS
- Create a map to store the parent of each node in the tree, Traverse the tree recursively (via depth-first search), at each step if the current node is not NULL. Store its parent in the map, then traverse the left and right subtree.
- Now assume that the given node is the root of the tree. In such a case, we can simply run a breadth-first search from the root, and track the current level of the tree. When the level = ‘K...
- Q2. Rahul And Minimum Subarray
Rahul is a programming enthusiast. He is currently learning about arrays/lists. One day his teacher asked him to solve a very difficult problem. The problem was to find the leng...
- Ans. Brute Force
The basic idea of this approach is to iterate the whole ‘ARR’ from start and find the sum of all the possible subarrays and find out the length of the minimum subarray whose sum is greater than the given value. We will use two loops and calculate the sum for all the possible subarrays and select the subarrays that match our given conditions.
Here is the algorithm:
- Declare a variable ‘MIN_LENGTH’ wh...
- Q3. Encrypt The Digits
Given a numeric string ‘STR’ which is a string containing numeric characters from ‘0’ to ‘9’, you have to encrypt the string by changing each numeric character as shown below:
‘0’ ->...
- Ans. Iterating
The idea is to simply encrypt each character using switch case statement or if-else ladder, where output character for each input character is taken care of.
Here is the algorithm:
- Run a loop from 0 to ‘N-1’ (say iterator = i):
- Initialize a character ‘ch’ = ‘STR[i]’.
- Use an if-else ladder to initialize the value of ‘STR[i]’ according to ‘ch’. For eg - if ‘ch’ equals ‘0’ , ‘STR[i]’ = ‘9’, if ‘ch’ equals...
- Run a loop from 0 to ‘N-1’ (say iterator = i):
(2 Questions)
Round duration - 50 minutes
Round difficulty - Medium
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Diagonal Traversal of a binary tree.
You have been given a binary tree of integers. You are supposed to find the diagonal traversal(refer to Example) of the given binary tree.
Example:
Consider lines at... - Ans. Map based approach
The idea is to use the Map to store all the nodes of a particular diagonal number. We will use preorder traversal to update the Map. The key of the Map will be the diagonal number and the value of the Map will be an array/list that will store all nodes belonging to that diagonal.
The steps are as follows:
- Assign the diagonal number of the root as 0.
- Do a preorder traversal of the binary...
- Q2. Parth And His OCD
Parth is a nerd programmer. He has started learning array/list programming. Parth has received an array/list ‘ARR’ of ‘N’ positive integers as a gift. Parth’s OCD gets triggered every tim...
- Ans. Brute Force
The basic idea of this approach is to iterate the whole ‘ARR’ from start and see if the element present at the current position satisfies the conditions or not. If the element at the current index is not as per requirement then we will find an element which can take that position from ‘ARR’ after that index and replace it with the current element.
Here is the algorithm:
- Run a loop for ‘i’ = 0...
(2 Questions)
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
- Q1. Subset Sum Equal To K
You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.
Note: Return true if ...
- Ans. Recursion
The idea is to generate all possible subsets and check if any of them sums up to ‘K’. This can be done through recursion.
Here is the algorithm:
subsetSumToK(N , K , ARR):
- Initialize integer variable ‘ANS’ = ‘helper(ARR, N, K)’. Here ‘helper’ is the recursive function that returns true/false.
- If ‘ANS’ is equal to 1 then:
- Return true.
- Else:
- Return false.
helper(ARR, N, K):
- Base case: If ‘N’ is less tha...
- Q2. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...
- Ans. Brute Force
For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.
Space Complexity: O(1)Explanation:O(1)
No extra space is used.
Time Complexity: O(n^2)Explanation:O(N ^ 2), Where N is the number of elements ...
Interview Preparation Tips
Tip 1 : Do at least 1 project in any technology
Tip 2 : Learn DSA at least these topics Array, LL, Tree, DP
Tip 1 : At least mention the projects and internships on your resume.
Tip 2 : Avoid unnecessary details like Hobbies, declaration, date.
Skills evaluated in this interview
Paytm interview questions for designations
Interview questions from similar companies
I applied via Campus Placement and was interviewed in Nov 2023. There were 2 interview rounds.
5 MCQ questions, and 1 coding question similar to Leetcode medium-hard level (topic-greedy).
(2 Questions)
- Q1. Basic DSA questions related to strings, linkedlists, binary search etc.
- Q2. Questions related to resume
Interview Preparation Tips
- DSA
- DBMS
Software Developer Intern Interview Questions & Answers
Broadridge Financial Solutions
Anonymous
posted on 22 Oct 2024
I applied via Campus Placement
1 hr , 3 sum leetcode question
Software Developer Intern Interview Questions & Answers
Broadridge Financial Solutions
Anonymous
posted on 3 Jul 2023
(2 Questions)
- Q1. Java questions were asked by them
- Q2. Python were asked by them
(2 Questions)
- Q1. Location preferences were asked by them
- Q2. Future what u wanna do was asked by them
I applied via Walk-in and was interviewed before Jul 2021. There were 2 interview rounds.
DSA Problems on LinkedList and Stack.
(1 Question)
- Q1. HM Round on projects and all
Interview Preparation Tips
I was interviewed before Jan 2021.
(1 Question)
Round duration - 75 minutes
Round difficulty - Easy
Simple question based on strings was given. MCQs based on basic aptitude and programming questions were asked.
Tips: Time management is important. Remember all the syntaxes
- Q1. Reverse the String
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
If the given string is: STR... - Ans.
This can be done by iterative swapping using two pointers. The first pointer points to the beginning of the string, whereas the second pointer points to the end. Both pointers keep swapping their elements and go towards each other. Essentially, the algorithm simulates the rotation of a string with respect to its midpoint.
Time Complexity : O(n)
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
It was a good experience.
Tips: If you don't know something just tell them. Don't try to answer something if you don't know anything about it
- Q1. One Away
You are given two strings, string A and string B. Your task is to determine whether string A can be transformed into string B by performing only one of the following operations at most one (or may...
- Ans.
The idea is to create a new character array and copy the characters from the original String before the given position
After that, we put the new character at the position and copy the rest of the characters from the original String in the subsequent positions of the new array.
Other option can be to directly use the already defined methods such as insert(). - Q2. Remove Duplicates From String
You are given a string (STR) of length N, consisting of only the lower case English alphabet.
Your task is to remove all the duplicate occurrences of characters in the strin...
- Ans.
Hashing can be used to approach this problem.
Use a hash map and maintain count of the occurrences of all the characters in the string which character as the string and count as the value. At last, traverse the hash map and print all those characters with count > 1.
Time Complexity : O(N) where N is the length of the string
Space Complexity : O(N)
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
It was easy. I could answer the first question. Second one I answered really badly
- Q1. Basic HR Questions
Q1. Explain the projects that I've done
Q2. What did you learn about PayPal today?
Q3. Why join PayPal? - Ans.
Tip 1 : Explain the projects done in the best possible way
Tip 2 : Get to know about the company as much as possible via seniors
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Revise C++/Java.
Tip 3 : If you don't know much of C++/Java at least write the codes in C.
Tip 4 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Jan 2021.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked me questions based on DSA and OOPS concepts.
- Q1. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...
- Ans.
Dijkstra's Algorithm basically starts at the source node and it analyzes the graph to find the shortest path between that node and all the other nodes in the graph.
The algorithm keeps track of the currently known shortest distance from each node to the source node and it updates these values if it finds a shorter path.
Once the shortest path between the source node and another node is found, that node is marked as "visi... - Q2. OOPS Question
Difference between C and C++
- Ans.
1. The C programming language is a procedural language type while C++ is an object-oriented programming language type.
2. C programming follows a top to down programming approach that focuses on the steps rather than the data. C++ follows a bottom-to-top approach that focuses on data rather than the overall procedure.
3. Since C is a structured programming language the program is divided into separate blocks known as fun... - Q3. OOPS Question
Difference between malloc and new
- Ans.
1. new calls constructor while malloc does not calls constructors
2. new is an operator. malloc () is a function.
3. new returns exact data type while malloc() returns void *
4. On failure, new throws bad_alloc exception. While malloc() on failure, returns NULL. - Q4. OOPS Question
What is virtual function?
- Ans.
A C++ virtual function is a member function in the base class that you redefine in a derived class. It is declared using the virtual keyword. It is used to tell the compiler to perform dynamic linkage or late binding on the function. A 'virtual' is a keyword preceding the normal declaration of a function. When the function is made virtual, C++ determines which function is to be invoked at the runtime based on the type
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round that lasted for around 60 minutes. The interviewer asked me questions based on SQL and OOPS concepts.
- Q1. DBMS Question
Query to find nth highest salary
- Ans.
TOP keyword can be used to find the nth highest salary. By default ORDER BY clause print rows in ascending order, since we need the highest salary at the top, we have used ORDER BY DESC, which will display salaries in descending order. Again DISTINCT is used to remove duplicates. The outer query will then pick the topmost salary, which would be your Nth highest salary.
SQL query :
SELECT TOP 1 salary
FROM (
SEL... - Q2. OOPS Question
OOPS contains 3 classes A,B,C and they are in multi level inheritance, was asked about the use of public, protected and private members of A in B and in C
- Ans.
When a subclass inherits a base class, it inherits only the members of superclass that are marked with public, protected visibility modes, these members are -
Properties of the base class.
Functions of the base class.
Note - Base class members marked with private visibility mode are never inherited. - Q3. OOPS Question
Difference between Stack and Heap
- Ans.
1. Stack is a linear data structure whereas Heap is a hierarchical data structure.
2. Stack memory will never become fragmented whereas Heap memory can become fragmented as blocks of memory are first allocated and then freed.
3.Stack memory is allocated in a contiguous block whereas Heap memory is allocated in any random order.
4. Stack variables can’t be resized whereas Heap variables can be resized.
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for around 30 minutes. The interviewer asked questions to know more about me. We also discussed a puzzle.
- Q1. Puzzle
Hourglasses Puzzle
- Ans.
1. At 0 minutes: Start both hourglasses at the same time.
2. At 4 minutes: 4 minutes hourglass runs out and flip it. 7 minutes hourglass is left with 3 minutes.
3. At 7 minutes: 4 minutes hourglass is left with 1 minute. 7 minutes hourglass runs out and flip it.
4.At 8 minutes: 4 minutes hourglass runs out and 7 is filled with 6 minutes and 1 minute on the other side. Flip it as the sand is left with 1 minute.
5. At 9 minu... - Q2. Basic HR Question
Q1. Firstly was asked about the subjects I'm studying this semester
Q2. Different questions about my projects
- Ans.
Tip 1 : The cross questioning can go intense some time, think before you speak.
Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.
Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team you are mentoring. How all is the
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Tell us how to improve this page.
Paytm Interviews By Designations
- Paytm Software Engineer Interview Questions
- Paytm Team Lead Interview Questions
- Paytm Software Developer Interview Questions
- Paytm Senior Software Engineer 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
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Intern Interview Questions
- Software Engineer Trainee Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Top Skills for Paytm Software Developer Intern
Interview Questions from Similar Companies
Fast track your campus placements
Paytm Software Developer Intern Reviews and Ratings
based on 2 reviews
Rating in categories
|
Team Lead
2k
salaries
|  ₹2.2 L/yr - ₹9.4 L/yr |
|
Senior Software Engineer
1.4k
salaries
| ₹10 L/yr - ₹41 L/yr |
|
Software Engineer
1.4k
salaries
| ₹5.4 L/yr - ₹23 L/yr |
|
Sales Executive
960
salaries
| ₹1 L/yr - ₹6.4 L/yr |
|
Senior Associate
906
salaries
| ₹2.1 L/yr - ₹9 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik
Calculate your in-hand salary
- Home >
- Interviews >
- Paytm Interview Questions >
- Paytm Software Developer Intern Interview Questions for Fresher
