AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
PayPal SDE-2 Interview Questions, Process, and Tips
Top PayPal SDE-2 Interview Questions and Answers
- Q1. Sum Queries in a Sorted Array Given two arrays arr and queries , your task is to determine the sum of all elements in arr that are less than or equal to each element in ...read more
- Q2. Minimum Character Deletion Problem Statement You have been provided a string STR . Your task is to find and return the minimum number of characters that need to be delet ...read more
- Q3. Count Ways To Reach The N-th Stair Problem Statement You are given a number of stairs, N . Starting at the 0th stair, you need to reach the Nth stair. Each time you can ...read more
PayPal SDE-2 Interview Experiences
4 interviews found
Anonymous
Selected
I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.
Had questions on graph
(1 Question)
- Q1. Binary Search leftmost rightmost
(1 Question)
- Q1. Monotonic stack question
(1 Question)
- Q1. System design round, discussed subscriber publisher design pattern
I appeared for an interview in May 2022.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
There will be 2 coding questions easy to medium based on DP and linkedlist.
- Q1.
Count Ways To Reach The N-th Stair Problem Statement
You are given a number of stairs,
N. Starting at the 0th stair, you need to reach the Nth stair. Each time you can either climb one step or two steps. ... - Ans.
The problem involves finding the number of distinct ways to climb to the N-th stair by taking one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the N-th stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle large inputs by taking modulo 10^9+7 of the result.
Example: For N=3, there are 3 ways to climb to the third sta
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
the questions will be be based on trees, linked list and stacks and queues, DP
- Q1.
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...
- Ans.
The task is to print the left view of a binary tree, which contains the nodes visible when the tree is viewed from the left side.
Traverse the tree level by level and keep track of the leftmost node at each level
Use a queue for level order traversal and a map to store the leftmost nodes
Print the values of the leftmost nodes stored in the map as the left view of the tree
- Q2.
Next Greater Element Problem Statement
You are given an array
arrof lengthN. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele... - Ans.
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
Use a stack to keep track of elements for which the next greater element is not found yet.
Iterate through the array from right to left and pop elements from the stack until a greater element is found.
Store the next greater element for each element in a separate array.
If the stack is empty afte...
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
(DSA, work experience and personal projects)
- Q1.
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list
ARRconsisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.Input:
The input sta...
- Ans.
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.
Iterate through the array and swap elements based on their values to achieve the sorting.
Time complexity should be O(N) where N is the number of elements in the array.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It started in the afternoon after the lunch.
- Q1. You will be given certain conditions for which you need to design a system. Can you explain your approach to low-level system design?
- Ans.
Approach to low-level system design involves understanding requirements, breaking down components, defining interfaces, and optimizing performance.
Understand the requirements and constraints of the system
Break down the system into smaller components/modules
Define clear interfaces between components for communication
Optimize performance by considering data structures, algorithms, and resource utilization
(1 Question)
Round duration - 25 minutes
Round difficulty - Easy
Once all the rounds were cleared. I was told that i have 1 more round with manager.
- Q1. How do you handle critical situations in a workplace?
- Ans.
I remain calm, assess the situation, prioritize tasks, communicate effectively, and collaborate with team members to find a solution.
Remain calm and composed under pressure
Assess the situation to understand the root cause
Prioritize tasks based on urgency and impact
Communicate effectively with team members and stakeholders
Collaborate with team members to brainstorm and implement solutions
Interview Preparation Tips
Tip 1 : If you are good with any programming Language(Java and C++ preferred but again its your choice) start with DSA directly. Learn the basic Arrays, Linked List, Stacks, Queues, Trees, Hashing, Graphs, Dynamic programming, Heaps, searching and sorting. (PS:-Courses and resources i will not mention as there are many materials available just choose the one you like and start preparing!!)
Tip 2 : Once you feel OK start practising problems try to solve by yourself, if not take hints, and at the end you can check solution if still unsolved.
Tip 3 : Try to connect with people on linkedin. Try to know the techstacks and try to get referrals. Keep on applying once feel ready 80% because you are never 100% ready for anything.
Tip 1 : Keep your resume updated with all the tech stacks you worked on, your projects, your latest experience.
Tip 2 : The resume need to be short and crisp. it takes only a min. For HR to read your resume. and align it with job requirement.
Skills evaluated in this interview
I appeared for an interview in May 2022.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
There were 2 coding questions. One was easy to medium difficult and other was of medium difficulty.
- Q1.
Sum Queries in a Sorted Array
Given two arrays
arrandqueries, your task is to determine the sum of all elements inarrthat are less than or equal to each element inqueries. The arrayarris provided i... - Ans.
Find sum of elements in a sorted array less than or equal to each element in queries.
Iterate through queries and for each query, find the sum of elements in arr less than or equal to the query element.
Use binary search to efficiently find the index of the last element less than or equal to the query element.
Keep track of cumulative sum while iterating through arr to avoid recalculating sums.
Return the list of sums for
- Q2.
Find K Closest Elements
Given a sorted array 'A' of length 'N', and two integers 'K' and 'X', your task is to find 'K' integers from the array closest to 'X'. If two integers are at the same distance, pre...
- Ans.
Given a sorted array, find K integers closest to X, preferring smaller ones in case of same distance.
Use binary search to find the closest element to X in the array.
Maintain two pointers to expand around the closest element to find K closest elements.
Compare distances and values to select the K closest elements, preferring smaller ones if distances are equal.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Reverse Only Letters Problem Statement
You are given a string
S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.Example:
Input:
S = "...
- Ans.
Reverse the letters of a string while keeping non-alphabet characters in their original position.
Iterate through the string and store the non-alphabet characters in their original positions.
Reverse the letters of the string using two pointers approach.
Combine the reversed letters with the non-alphabet characters to get the final reversed string.
- Q2.
Find The Sum Of The Left Leaves Problem Statement
Given a binary tree with ‘root’, your task is to find and return the sum of all the left leaf nodes.
Example:
Input:
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1...
- Ans.
Find and return the sum of all the left leaf nodes in a binary tree.
Traverse the binary tree using depth-first search (DFS)
Check if a node is a leaf node and a left child
Sum up the values of all left leaf nodes
Round duration - 60 Minutes
Round difficulty - Easy
Questions related to Java, OOPs, SQL etc.
Round duration - 60 Minutes
Round difficulty - Easy
It was an HR round.Questions related to resume, Low level design, work experience, behavioural etc. This round stretched more than scheduled time so another round was scheduled which was again a DSA based technical round.
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 3 problems. easy, medium and hard.
- Q1.
Median of Two Sorted Arrays
Given two sorted arrays
AandBof sizesNandM, find the median of the merged array formed by combining arraysAandB. If the total number of elements,N + M, is even, the m... - Ans.
Find the median of two sorted arrays by merging them and calculating the median of the combined array.
Merge the two sorted arrays into one sorted array.
Calculate the median of the combined array based on the total number of elements.
Return the median as the result.
- Q2.
Palindrome Checker Problem Statement
Given an alphabetical string
S, determine whether it is a palindrome or not. A palindrome is a string that reads the same backward as forward.Input:
The first line ... - Ans.
Check if a given string is a palindrome or not.
Iterate through the string from both ends and compare characters.
If all characters match, return 1 indicating a palindrome.
If any characters don't match, return 0 indicating not a palindrome.
- Q3.
Minimum Character Deletion Problem Statement
You have been provided a string
STR. Your task is to find and return the minimum number of characters that need to be deleted fromSTRso that each character's... - Ans.
Find the minimum number of character deletions needed to make each character's frequency unique in a given string.
Iterate through the string and count the frequency of each character.
Identify characters with the same frequency and calculate the minimum deletions needed to make them unique.
Return the total minimum deletions for each test case.
Interview Preparation Tips
Tip 1 : Practice Daily. Consistency is the key
Tip 2 : Try to do at least 5 questions daily (LC, gfg, etc any platform u are comfortable with)
Tip 3 : Have some projects on resume related to the tech stack you want to work with.
Tip 1 : Have some projects on resume.
Tip 2 : Be prepared with in depth questions on whatever is written on resume
Skills evaluated in this interview
What people are saying about PayPal
I appeared for an interview before May 2021.
(1 Question)
Round duration - 50 minutes
Round difficulty - Easy
Problem-solving round in javascript.
Asked me questions of easy to medium level data structures and algorithm.
- Q1.
Similar String Groups Problem Statement
Two strings
S1andS2are considered similar if eitherS1equalsS2or we can swap two letters ofS1at different positions so that it equalsS2.Input:
The first... - Ans.
The problem involves determining the number of similar string groups in a given list of strings based on a specific criteria.
Iterate through each pair of strings in the list and check if they are similar based on the given criteria.
Use a hash set to keep track of visited strings to avoid counting duplicates in the same group.
Consider implementing a function to check if two strings are similar by allowing at most one sw...
Round duration - 50 minutes
Round difficulty - Medium
Javascrip specific questions
Round duration - 50 minutes
Round difficulty - Easy
Focussed on behavioural aptitude
Interview Preparation Tips
Tip 1 : Prepare the concepts of JavaScript and react thoroughly
Tip 2 : Practice using projects
Tip 3 : Practice data structure and algorithms and practice there questions
Tip 1 : Use keywords in technologies where you want to be shortlisted in
Tip 2 : Do not put false things in your resume
PayPal interview questions for designations
Interview questions from similar companies
I appeared for an interview in May 2022.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
Anytime
- Q1.
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list
ARRconsisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.Input:
The input sta...
- Ans.
The task is to sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.
Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.
While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If
- Q2.
Connect Ropes with Minimum Cost
Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...
- Ans.
The task is to connect N ropes into one rope with minimum cost.
Sort the array of rope lengths in ascending order.
Initialize a variable to keep track of the total cost.
While there are more than one rope, take the two shortest ropes and connect them.
Add the cost of connecting the two ropes to the total cost.
Replace the two shortest ropes with the connected rope.
Repeat the above steps until only one rope remains.
Return th
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Maximum Subarray Sum Problem Statement
Given an array
ARRconsisting ofNintegers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.Example of Sub...
- Ans.
The task is to find the maximum possible sum of a non-empty subarray of an array.
Iterate through the array and keep track of the maximum sum encountered so far
If the current element is greater than the sum so far, start a new subarray
If the current element plus the sum so far is greater than the maximum sum, update the maximum sum
Return the maximum sum
- Q2.
Diameter of a Binary Tree Problem Statement
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...
- Ans.
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.
To find the diameter of a binary tree, we can use a recursive approach where we calcu...
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
This round was more aroung sytem design and my past work experience.
- Q1. Can you describe the system design for a platform like BookMyShow and the questions that were raised during the discussion?
- Ans.
Design a bookmyshow system
Design a system to book and manage movie tickets
Consider features like seat selection, payment, and ticket cancellation
Include user authentication and authorization
Implement a database to store movie and theater information
Consider scalability and performance of the system
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
This is non-tech round.They just want to check your nature ,attitude and team work skills.
- Q1. Why do you want to leave your current job and what are your thoughts on the CTC being offered?
- Ans.
I want to leave my current job for better growth opportunities and a more challenging role.
Seeking new challenges and opportunities for professional growth
Looking for a role that aligns better with my skills and interests
Desire to work in a more dynamic and innovative environment
Seeking better compensation and benefits
Wanting to expand my knowledge and skills in a different domain
Interview Preparation Tips
Tip 1 : Pratice DSA and focus on the core subject like Database and OS
Tip 2 : Practice atlest 2 question everday to maintain consistency.
Tip 1 : Crisp Resume : Every body knows about this step, you must create a crisp resume mentioning about your key skills, always add impact numbers if possible (for example : increased efficiency by 50%, reduced cost by 2X, etc.) Add keywords around your skills, highlight them using BOLD in resume.
Tip 2 : Use Linkedin : Send connections requests directly to the recruiters rather than asking for referrals.
Skills evaluated in this interview
Selected
I applied via Hirist and was interviewed in Feb 2023. There were 6 interview rounds.
Create separate modules and communicate between them
(2 Questions)
- Q1. Basic android questions and assignment-related questions
- Q2. MVVM, Room DB, Coroutines
(2 Questions)
- Q1. Advanced android questions
- Q2. Viewmodel Working, Work Manager, Versioning, Storage, Networking
(1 Question)
- Q1. Managerial questions
(2 Questions)
- Q1. HR interview questions
- Q2. General HR questions
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?
- 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
Interview Questionnaire
21 Questions
- Q1. Discussion of previous written test questions
- Q2. Find the odd repeating element from a set of repeating elements
- Ans.
Find the odd repeating element from an array of strings
Use a hash table to count the frequency of each element
Iterate through the hash table to find the element with an odd count
- Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
- Ans.
Finding an element in a sorted 2D matrix
Start from the top right corner or bottom left corner
Compare the target element with the current element
Move left or down if the target is smaller, else move right or up
Repeat until the target is found or all elements are checked
- Q4. SQL Query to find Nth highest salary from table
- Ans.
SQL query to find Nth highest salary from table
Use ORDER BY and LIMIT clauses
Use subquery to get the Nth highest salary
Handle cases where there are less than N distinct salaries
- Q5. Another basic SQL query
- Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
- Ans.
Function to swap '3' and '4' without using if-else
Use XOR operator to swap the values
Convert the input to ASCII code and perform the swap
Use a lookup table to map the values
- Q7. Question on Suffix trees
- Q8. Question on Tries
- Q9. Question on Ternary search trees
- Q10. Question on hash maps
- Q11. Question on complexity of an algorithm
- Q12. 3-4 SQL queries
- Q13. Question on SQL joins
- Q14. JAVA questions on static block,static function and static variables
- Q15. JAVA questions on memory initialization and references
- Q16. Puzzle on measuring exactly half a glass of water
- Q17. Introduce yourself
- Ans.
I am a software developer with experience in Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using Spring framework
Familiarity with database management systems like MySQL and MongoDB
- Q18. Why PAYTM?
- Ans.
PAYTM is a leading digital payment platform in India with a wide range of services.
PAYTM has a user-friendly interface and offers a seamless payment experience.
It provides a variety of services like mobile recharges, bill payments, and online shopping.
PAYTM has a strong focus on security and fraud prevention measures.
It has a large user base and is widely accepted by merchants across India.
PAYTM is constantly innovatin...
- Q19. Will you go for further studies?
- Ans.
Yes, I am open to pursuing further studies in the future.
I believe in continuous learning and staying updated with the latest technologies.
Further studies can help me specialize in a particular field and enhance my skills.
I may consider pursuing a master's degree in computer science or a related field.
However, my immediate focus is on gaining practical experience and contributing to the organization.
- Q20. Why do you think has PAYTM grown so fast?
- Ans.
PAYTM grew fast due to its innovative approach and early adoption of digital payments.
Early adoption of digital payments in India
Innovative approach with features like mobile recharges, bill payments, and cashback offers
Expansion into e-commerce and financial services
Strategic partnerships with major companies like Uber and Alibaba
- Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?
Interview Preparation Tips
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.
Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)
Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know
Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)
Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)
General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth
Skills evaluated in this interview
MAYANK DEEP
Interview Preparation Tips
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.
Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.
College Name: BITS Pilani
Interview Preparation Tips
College Name: na
PayPal Interview FAQs
Tell us how to improve this page.
PayPal Interviews By Designations
- PayPal Software Engineer Interview Questions
- PayPal Data Scientist Interview Questions
- PayPal Software Developer Interview Questions
- PayPal Senior Software Engineer Interview Questions
- PayPal Risk Analyst Interview Questions
- PayPal Data Analyst Interview Questions
- PayPal Software Engineer2 Interview Questions
- PayPal SDE-2 Interview Questions
- Show more
Interview Questions for Popular Designations
PayPal SDE-2 Interview Process
based on 1 interview
1 Interview rounds
- Coding Test Round
Interview Questions from Similar Companies
Fast track your campus placements
PayPal SDE-2 Reviews and Ratings
based on 2 reviews
Rating in categories
|
Software Engineer2
303
salaries
|  ₹15 L/yr - ₹44 L/yr |
|
Software Engineer
247
salaries
| ₹12 L/yr - ₹45.6 L/yr |
|
Software Engineer III
246
salaries
| ₹17 L/yr - ₹72 L/yr |
|
Senior Software Engineer
219
salaries
| ₹15 L/yr - ₹55.4 L/yr |
|
Data Scientist
171
salaries
| ₹16.8 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard
- Home >
- Interviews >
- PayPal Interview Questions >
- PayPal SDE-2 Interview Questions
