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 Developer Intern Interview Questions and Answers for Freshers
11 Interview questions
Find All Pairs Adding Up to Target
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 the Target.
Input:
The first line c...Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it does, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwee...
The task is to find the diameter of a binary tree, which is the longest path between any two nodes in the tree.
Traverse the tree to find the longest path between any two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input '1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1...
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the first...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true if such a subset exists, otherwise re...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset sum is possible for each element and sum
Iterate through the array and update the 2D array accordingly
Check if the subset sum for K is possible using the 2D array
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell t...
Given stock prices for 'N' days, find maximum profit with up to two buy-and-sell transactions.
Iterate through the array of stock prices to find the maximum profit with two transactions
Keep track of the maximum profit by considering all possible buy and sell combinations
Ensure to sell the stock before buying again to maximize profit
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 an...
Find the diagonal traversal of a binary tree of integers.
Traverse the binary tree diagonally using a queue and a map to store nodes at each diagonal level.
Use a depth-first search approach to traverse the tree and populate the map with nodes at each diagonal level.
Iterate through the map to get the diagonal traversal of the binary tree.
Parth's OCD Challenge
Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at an even index or an even number at an odd ind...
Reorder array to avoid odd numbers at even indices and even numbers at odd indices.
Swap odd numbers at even indices with the nearest odd number at an odd index.
Swap even numbers at odd indices with the nearest even number at an even index.
Maintain counts of odd and even numbers to ensure equal distribution.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of the...
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
Traverse the binary tree to find the target node.
From the target node, perform a depth-first search to find nodes at distance K.
Use a recursive function to keep track of the distance from the target node.
Return the values of nodes found at distance K in any order.
Find All Occurrences in Matrix
You are provided with a matrix of characters, CHARACTER_MATRIX of size M x N, and a string WORD. Your goal is to locate and display all occurrences of the string within the m...
Find all occurrences of a given string in a matrix in all eight possible directions.
Iterate through each cell in the matrix and check for the starting character of the word.
For each starting character found, check in all eight directions for the complete word.
Keep track of the coordinates of each character in the word for each occurrence.
Print the coordinates of each character for all occurrences found.
If no occur...
Encrypt The Digits Problem Statement
Given a numeric string STR consisting of characters from ‘0’ to ‘9’, encrypt the string by replacing each numeric character according to the mapping:
‘0’ -> ‘9’, ‘1’ ...
Encrypt each digit in a numeric string by replacing it with its encrypted equivalent.
Iterate through each character in the string and replace it with its encrypted equivalent
Use a mapping to determine the encrypted equivalent of each digit
Return the encrypted string for each test case
Paytm Software Developer Intern Interview Experiences for Freshers
4 interviews found
Anonymous
I appeared for an interview 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.
Binary Tree Diameter Problem Statement
Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...
- Ans.
The diameter of a binary tree is the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two leaf nodes.
Use depth-first search (DFS) to calculate the height of each subtree.
The diameter is the sum of the heights of the left and right subtrees + 1.
- Q2.
Find All Pairs Adding Up to Target
Given an array of integers
ARRof lengthNand an integerTarget, your task is to return all pairs of elements such that they add up to theTarget.Input:
The first line ... - Ans.
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it does, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
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.
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 appeared for an interview in Dec 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Easy
- Q1.
Parth's OCD Challenge
Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at an even index or an even number at an odd in...
- Ans.
Reorder array to avoid odd numbers at even indices and even numbers at odd indices.
Swap odd numbers at even indices with the nearest odd number at an odd index.
Swap even numbers at odd indices with the nearest even number at an even index.
Maintain counts of odd and even numbers to ensure equal distribution.
- Q2.
Find All Occurrences in Matrix
You are provided with a matrix of characters,
CHARACTER_MATRIXof sizeM x N, and a stringWORD. Your goal is to locate and display all occurrences of the string within the ... - Ans.
Find all occurrences of a given string in a matrix in all eight possible directions.
Iterate through each cell in the matrix and check for the starting character of the word.
For each starting character found, check in all eight directions for the complete word.
Keep track of the coordinates of each character in the word for each occurrence.
Print the coordinates of each character for all occurrences found.
If no occurrence...
- Q3.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
Traverse the binary tree to find the target node.
From the target node, perform a depth-first search to find nodes at distance K.
Use a recursive function to keep track of the distance from the target node.
Return the values of nodes found at distance K in any order.
(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
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.
Find the diagonal traversal of a binary tree of integers.
Traverse the binary tree diagonally using a queue and a map to store nodes at each diagonal level.
Use a depth-first search approach to traverse the tree and populate the map with nodes at each diagonal level.
Iterate through the map to get the diagonal traversal of the binary tree.
- Q2.
Binary Tree Diameter Problem Statement
Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...
- Ans.
The diameter of a binary tree is the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two leaf nodes.
Use depth-first search (DFS) to calculate the height of each subtree.
The diameter is the sum of the heights of the left and right subtrees + 1.
(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 Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements whose NGE is yet to be found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the NGE as the top element of the stack or -1 if the stack is empty.
Repeat the process for all elements in the list to find their NGEs.
- Q2.
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide
trueif such a subset exists, otherwise r... - Ans.
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset sum is possible for each element and sum
Iterate through the array and update the 2D array accordingly
Check if the subset sum for K is possible using the 2D array
(1 Question)
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 Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
- Ans.
Given stock prices for 'N' days, find maximum profit with up to two buy-and-sell transactions.
Iterate through the array of stock prices to find the maximum profit with two transactions
Keep track of the maximum profit by considering all possible buy and sell combinations
Ensure to sell the stock before buying again to maximize profit
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 appeared for an interview 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
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
Traverse the tree to find the target node.
From the target node, perform a depth-first search to find nodes at distance K.
Use a recursive function to keep track of the distance from the target node.
Return the values of nodes found at distance K in any order.
- Q2.
Rahul And Minimum Subarray Challenge
Rahul is learning about arrays and lists. His teacher gave him a task to find the length of the smallest subarray in a given array 'ARR' of size 'N' with its sum great...
- Ans.
Find the length of the smallest subarray in a given array with sum greater than a given value.
Iterate through the array while keeping track of the current subarray sum.
Use two pointers technique to find the smallest subarray with sum greater than X.
Update the minimum subarray length as you iterate through the array.
Return the length of the smallest subarray found.
Example: For ARR = [1, 2, 21, 7, 6, 12] and X = 23, the ...
- Q3.
Encrypt The Digits Problem Statement
Given a numeric string
STRconsisting of characters from ‘0’ to ‘9’, encrypt the string by replacing each numeric character according to the mapping:
‘0’ -> ‘9’, ‘1’... - Ans.
Encrypt each digit in a numeric string by replacing it with its encrypted equivalent.
Iterate through each character in the string and replace it with its encrypted equivalent
Use a mapping to determine the encrypted equivalent of each digit
Return the encrypted string for each test case
(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
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 is finding the nodes in the tree along the diagonals from top-left to bottom-right.
Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.
Use a queue to keep track of nodes at each level of the tree.
Maintain a map to store nodes at each diagonal level and then print the nodes in the map in the required order.
- Q2.
Parth's OCD Challenge
Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at an even index or an even number at an odd in...
- Ans.
Reorder array to avoid odd numbers at even indices and even numbers at odd indices.
Swap odd numbers at even indices with the nearest odd number at an odd index, and vice versa.
Use two pointers approach to iterate through the array and swap elements accordingly.
Ensure the array has equal numbers of odd integers and odd-index positions and vice-versa.
(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 Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide
trueif such a subset exists, otherwise r... - Ans.
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset sum is possible for each element and sum
Iterate through the array and update the 2D array accordingly
Check if the subset sum for K is possible at the end
- Q2.
Next Greater Element Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements whose NGE is yet to be found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the NGE as the top element of the stack or -1 if the stack is empty.
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
I appeared for an interview 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
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 the same diagonal in a specific order.
Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.
Use a queue to keep track of nodes at each level of the tree.
Print the nodes in each diagonal level in the order they are encountered.
Example: For the given binary tree, the diagonal traversal w...
- Q2.
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
- Ans.
The task is to find the diameter of a binary tree, which is the longest path between any two nodes in the tree.
Traverse the tree to find the longest path between any two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input '1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1',...
(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 Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
- Q2.
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide
trueif such a subset exists, otherwise r... - Ans.
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store if a subset sum is possible for each element and target sum.
Iterate through the array and update the 2D array based on the current element and target sum.
Check if the 2D array contains true for the target sum at the end.
(1 Question)
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 Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
- Ans.
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and keep track of the maximum profit that can be achieved with two transactions.
Maintain variables to store the maximum profit after the first buy-sell, the maximum profit after the second buy-sell, and the minimum price encountered s...
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
Top trending discussions
Interview questions from similar companies
Shilpa Nandy
I applied via Naukri.com and was interviewed before Dec 2021. There were 5 interview rounds.
It was overall an easy test. It had Aptitude , logical reasoning and technical questions.
It had 2 coding questions. , Both were moderate level questions
(2 Questions)
- Q1. It was overall a good technical round
- Q2. Be clear with whatever you write in your resume.
(1 Question)
- Q1. Tell me something about yourself
Interview Preparation Tips
Interview Questionnaire
2 Questions
- Q1. About AWS and Cloud related services.
- Q2. NA
Pranav Bhat Thirthahalli
Interview Questionnaire
14 Questions
- Q1. What is race condition and how can it be eliminated
- Ans.
Race condition is a situation where multiple threads/processes access and manipulate shared data simultaneously.
It can be eliminated by using synchronization techniques like locks, semaphores, and mutexes.
Another way is to use atomic operations that ensure the data is accessed and modified atomically.
Using thread-safe data structures can also prevent race conditions.
Example: Two threads trying to increment a shared var...
- Q2. What is JCube?
- Ans.
JCube is a Java library for creating and manipulating Rubik's Cube puzzles.
JCube provides classes for representing Rubik's Cube puzzles and algorithms for solving them.
It supports various cube sizes and can generate random scrambles.
JCube can be used in Java applications or as a standalone command-line tool.
It is open source and available on GitHub.
- Q3. What is regression testing?
- Ans.
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software
It ensures that existing functionality is not affected by the changes
It helps to catch any defects or bugs that may have been introduced
It can be automated using testing tools
Examples include retesting after bug fixes, testing after new...
- Q4. Discussion on different sorting techniques
- Q5. Discussion on SQL and SQL optimisaion
- Q6. Software engineering principles
- Ans.
Software engineering principles are the best practices and guidelines for developing high-quality software.
Software should be designed with modularity and scalability in mind.
Code should be well-documented and easy to read.
Testing and debugging should be an integral part of the development process.
Version control should be used to manage code changes.
Security and privacy should be considered throughout the development ...
- Q7. Java and OOP's question
- Q8. Define Singleton class
- Ans.
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
- Q9. Explain Testing principles and Design principles
- Ans.
Testing principles ensure software quality, while design principles guide software development.
Testing principles include unit testing, integration testing, and acceptance testing.
Design principles include SOLID, DRY, and KISS.
Testing principles ensure that software meets requirements and is free of defects.
Design principles guide software development to be modular, maintainable, and scalable.
- Q10. Types of machine learning and methods and examples, they may give you a situation and ask you which technique is good and why
- Q11. Why choose you for VISA?
- Ans.
I have the necessary skills, experience, and passion to contribute to VISA's success.
I have a strong background in software development and have worked on projects similar to those at VISA.
I am a quick learner and can adapt to new technologies and programming languages easily.
I am passionate about creating high-quality software that meets the needs of users and exceeds their expectations.
I am a team player and can work...
- Q12. Which profile is good for you?
- Ans.
A profile that challenges me to learn and grow while allowing me to contribute to a team.
A position that encourages continuous learning and development
A role that allows me to collaborate with a team and contribute to projects
A company culture that aligns with my values and work ethic
- Q13. About the work culture at VISA Inc
- Q14. If u already have a placement, why this company
- Ans.
I am interested in exploring new opportunities and challenges that this company can offer.
I am impressed with the company's reputation and growth potential.
I am excited about the projects and technologies this company is working on.
I believe this company can provide me with a better work-life balance and career growth opportunities.
I am looking for a company culture that aligns with my values and goals.
I am open to exp...
Interview Preparation Tips
Experience: Online Test on mettl.com
- 2 coding questions ( 15*2 = 30 marks ) - Moderate level
- 10 MCQs on Programming and Java ( 1*10 = 10)
- 6 MCQs on Machine Learning and Hadoop ( 1*6 = 6 )
- 6 MCQs on Computer Networks ( 1*6 = 6 )
- 6 MCQs on Computer Infrastructure and Architecture ( 1*6 = 6)
- 6 MCQs on Application security and Cryptography ( 1*6 = 6)
15 shortlisted from here including 8 B.Techs and 7 M.Techs for F2F interviews, which were taken by VISA employees from their US and Singapore offices( since they don't have any office at India ).
Round: Technical Interview
Experience: They may give you a situation and ask you to explain which Software engineering principles will you use. They ask you how will you explain the concept of stacks and queues to a 7 year old, or to a granny, so as to encourage programming(like seriously ? )
General Tips: Nothing as such, since this was my second on-campus placement, I had good experience of interviews.
Keep your fundamentals in all computer science subjects open. Unlike other companies they don't focus much on coding alone. The only other company which also looks at perfection in all computer science aspects is Xerox Research Center India.
Challenging and Equally rewarding, but seriously a unique experience with no much tension
Skills:
College Name: NIT Surathkal
Skills evaluated in this interview
Interview Questionnaire
7 Questions
- Q1. Discussion on my internships and course projects.
- Q2. My field of interest, how well have I fared in it.
- Q3. Design a mvc controller system where given a url, I am able to invoke the right controller. Eg, given "xyz.com/a/b/c", I should be able to invoke c controller by going through a and b
- Ans.
Design an MVC controller system to route URLs to the appropriate controllers based on the URL structure.
Define a routing mechanism that maps URLs to controller actions.
Use a hierarchical structure where each segment of the URL corresponds to a controller.
Example: For 'xyz.com/a/b/c', 'a' routes to 'AController', 'b' to 'BController', and 'c' to 'CController'.
Implement a method to parse the URL and invoke the correspond...
- Q4. Design autocomplete in IDEs
- Ans.
Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.
Autocomplete should suggest code snippets based on the context of the code being written
Autocomplete should prioritize suggestions based on frequency of use
Autocomplete should also suggest variable and function names
Autocomplete should be customizable to allow for user-defined snippets and suggestions
Exa...
- Q5. What is my weakness
- Ans.
My weakness is public speaking.
I tend to get nervous when speaking in front of large groups.
I am working on improving my public speaking skills by practicing and seeking feedback.
I have taken courses and attended workshops to help me overcome my fear of public speaking.
- Q6. Given 2 game scenarios for basketball, and given p as the probability of making a basket in an attempt, I have to understand the condition where game1 would be preferable over game2. In first game, I have ...
- Ans.
Comparing 2 basketball game scenarios with different number of trials and baskets required to win
Calculate the probability of winning in each game scenario using binomial distribution formula
Compare the probabilities to determine which game scenario is preferable
In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets
If p is high, game1 is pref...
- Q7. Given a dictionary of words, I have to go from one word to another in least number of transitions where a transition is a defined as changing any letter of the current word such that the new word is also i...
Interview Preparation Tips
Experience: The test was on hackerrank.
Tips: * Fast coding and problem solving required
* Time crunch
* The test is valued a LOT in the hiring process
Duration: 120 minutes
Total Questions: 4
Round: Technical Interview
Experience: Question 1 : He tried to take the discussion to web based technologies to which I straightly told I don’t know. Not sure if that was a good decision. Nevertheless, he went over my resume a lot of times and asked about various projects.
Question 2 : Discussed the various projects related to it.
Question 3 : He asked this question because I had worked on django during my FB internship. I proposed a tree based structure. xyz.com/a/b/c ---> b is child of a, c is child of b.
Question 4 : Next he moved to a very interesting question. Given a simple text editor, I want to facilitate autocomplete feature. We discussed about syntactic methods using language specific keywords. I suggested a trie based implementation which he liked. Later he asked me to improve and redirected me to using scope of the variables, and grammar of the language. We discussed about all the steps I did in language translators lab (macrojava -> minijava -> typechecking -> miniIR -> microIR -> miniRA ->Mips) where we built a Java compiler in Java. We later hopped back to original question and I suggested that we can use grammar to to store multiple (nested kind of) tries for different scope. He asked me how would I define “scope”. He gave me a scenario which helped me come up with the nested trie structure
int a;
{
int b;
{
int c; //a b c can be used
}
{
int d; //a b d can be used
}
}
He then asked me details of how I would code. I said we could use the respective visitors and maintain the current trie root for scope. He liked it but I missed at 2 places :
1. He asked me about token generation used in a compiler and I said flex and bison. I was expected to elaborate a bit.
2. He asked me how the grammar is generated and how the visitors are invoked. I couldn’t explain properly because I was not thorough with it.
Tips: * Keep smiling in the interviews.
* My interviewer had hopped from Microsoft to Visa. We had a short detailed discussion on how the transition was and what drove him to do that.
* It’s always good to know about the company to pick up interesting discussions, read up latest articles and news
* The interviewers want to see if you are passionate about what they are building. Their PPT (Pre Placement Talk) was also focussed majorly on the technologies they are building.
* If you take a question in a direction, make sure you are very very thorough with it. I took it in the direction of compilers, but couldn't make the transition seamlessly because I wasn't thorough with a lot of things (like token generation, visitor invocation).
* Not sure if telling upfront that you don't know about web technologies when you are applying for a profile that might need it is a good idea or not.
Round: Technical Interview
Experience: I think he was a senior person and spoke very passionately about the work that is happening in visa Bangalore office.
Question 1 : I said maybe I should have learnt a little about web based technologies. I think he was looking for a more generic answer.
Question 2 : I went ahead with calculating the expected score where my score random variable = 1 with probability p, and 0 with probability (1-p). I conditioned that expected score of game1 > game2 which would give me the range of p. I goofed up the equations twice but he said he liked my approach and I was just there
Question 3 : I suggested building a graph where a node is a word and an edge means a transition, and then performing BFS. He said that was obvious and that he was more interested in knowing how I build the graph. I suggested a method to reduce the number of string comparisons by storing a count vector with each word. Count vector is a 26 length vector where count[i] = number of times that letter occurs in the word. I would do string comparison to identify neighbours only if the difference in count vectors in 2. Eg, cot = cat - a + o. String comparison is still needed because of false positives. Eg, oct = cat - a + o but cat -> oct is not a valid transition. He liked my approach and asked me to code, discussed the complexity.
Tips: * Don't be naive around a senior engineer. Be confident.
* Explain your approach before going ahead solving it. I missed that in Q1 and for a long time he didn't know what I was heading towards.
* Write clean code, practice coding on paper to make sure you write compilable code. Shabby code is a turn off.
* Show passion for the company you are applying for.
General Tips: * Be friendly and keep smiling.
* Know about the company, well in detail. Recent news, articles, acquisitions, organisational changes, new offices, new product, etc.
* Know about the volume the company handles, certain mind boggling figures, what the company *does not* do
* If you are introducing yourself as an expert in a certain field, be prepared for questions like "How will you contribute to our company with your expertise" type of questions.
* Be very very thorough with every single thing you write on your resume. A small point you weren't sure about might become the basis of your whole interview. Don't write things you are unsure of, or have worked very little on.
Skill Tips: * I think I didn’t take Visa very seriously. I was assuming they won’t take a undergrad and they won’t take me because I have 0 knowledge in web based technologies. I might have acted a little cocky.
* They had nice pie diagrams which shows that they had done thorough research about each and every candidate based on resume and the coding test.
* They value the coding test a lot.
* Be very thorough with the projects you write on resume. They will give you a problem which won't be straightforward and will map onto one of your course projects. You are expected to do the mapping seamlessly. Every bit of the discussion you have with the interviewer can be your next problem.
* Brush up on web based technologies if you can.
* There will be a HR round as well if you clear the technical interviews.
Skills: Maths(esp Probability), Design, Passion, Web Technologies, Technical Skill And Speaking Skill, Coding Skills
College Name: IIT Madras
Motivation: * Been the leader since more than half a century, been through the technological revolution.
* Revolutionising payments architecture. Building something of greatest need, so elegant and optimised, yet producing such consistent performance.
* Keeping up with the need of the generation by introducing features which are brand new. Eg, “all-purpose credit card”.
* Loved their PPT (Pre Placement Talk). Volume of the data and processing is IMMENSE. Billions of transactions in a year voluming up to trillions. More than 200 countries in the world --> these stats are HUGE.
* Fraud detection is a space I would have loved to work on given that I come from a Data Mining background.
Funny Moments: Chucked out before HR round :P
Skills evaluated in this interview
Interview Questionnaire
2 Questions
- Q1. Why would you like to join Visa and why?
- Ans.
I want to join Visa to contribute to innovative payment solutions and be part of a global leader in financial technology.
Visa is at the forefront of digital payment innovation, allowing me to work on cutting-edge technologies.
The company's commitment to security aligns with my passion for developing secure software solutions.
Visa's global presence offers opportunities to collaborate with diverse teams and learn from di...
- Q2. Tell me about yourself
Interview Preparation Tips
Experience: Coding Questions were fairly standard ones.
Duration: 75 minutes
Total Questions: 42
Round: Interview
Experience: Networks based questions, firewalls, TCP/IP and other OSI layers
Round: Interview
Experience: Coding questions. Asked to code on paper. Questions on Object Oriented Design.
Skills: Networks basics, OOPs basics, Coding Skills
College Name: IIT Guwahati
Motivation: Profiles offered, Package, Location
Interview Preparation Tips
Experience: Questions on
1. Programming: 10 Questions2. Machine Learning Hadoop MCQ: 6 Questions3. Networking MCQ: 6 Questions4. Operating System: 6 Questions5. Infrastructure: 6 Questions6. Application Security: 6 Questions
Tips: Questions were simple , except sections 2,5 unless you have a basic idea about it.
Duration: 75 minutes
Total Questions: 34+2
Round: Technical Interview
Experience: – Projects, Internship– Asymmetric and Symmetric encryption with some real world usage– Concepts behind Digital Signature and Digital Certificates– Detailed discussion on HTTPS– Basic OS concepts : Threads, Mutex , Semaphores– Basic OOPS concepts : Virtual functions , Function overloading and overriding , encapsulation.
Tips: Focus on Network Security concepts !
Round: Technical Interview
Experience: – Projects , Internship– Some discussion on Testing and how you would design a unit test case and a complete project test case. Discussion on Automated Testing.– How does a Web application work.– Software Development Models– Discussion on interpreted language and compiled language– Some DBMS basics for efficiency :- Indexing viz. B+trees , Hashing.– Some discussion on Apple Pay , VbV (Verified by Visa) (informal)
Round: HR Interview
Experience: Basic HR questions !
General Tips: Confidence is the key along with sufficient coding practice both on the IDE and pen-paper.
Skills: Network Security, Programming, Algorithms, Operating System
College Name: IIT ROORKEE
Tell us how to improve this page.
Paytm Interviews By Designations
- Paytm Team Lead Interview Questions
- Paytm Software Engineer 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
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Top Skills for Paytm Software Developer Intern
Interview Questions from Similar Companies
Paytm Software Developer Intern Reviews and Ratings
based on 2 reviews
Rating in categories
|
Team Lead
1.9k
salaries
|  ₹4.2 L/yr - ₹9.1 L/yr |
|
Senior Software Engineer
1.5k
salaries
| ₹14.8 L/yr - ₹32 L/yr |
|
Software Engineer
1.4k
salaries
| ₹10 L/yr - ₹17.3 L/yr |
|
Senior Associate
955
salaries
| ₹3.3 L/yr - ₹7.5 L/yr |
|
Key Account Manager
909
salaries
| ₹4.5 L/yr - ₹10 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik
- Home >
- Interviews >
- Paytm Interview Questions >
- Paytm Interview Questions for Fresher
