Filter interviews by
Detecting loop in a linked list
Use two pointers, one moving one node at a time and the other moving two nodes at a time
If there is a loop, the two pointers will eventually meet
If any of the pointers reach the end of the list, there is no loop
The question asks for the number of pairs between 1 and N that satisfy a specific mathematical relation.
The relation is pow(a,3) + pow(b,3) = pow(c,3) + pow(d,3)
The values of a, b, c, and d should be less than or equal to N
Count the number of pairs that satisfy the relation
To find a cycle in a graph, use depth-first search (DFS) and keep track of visited nodes.
Implement DFS algorithm to traverse the graph
Maintain a visited array to keep track of visited nodes
If a visited node is encountered again during DFS, a cycle exists
DFS (Depth-First Search) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS uses a stack to keep track of visited nodes and explore adjacent nodes.
It can be implemented recursively or iteratively.
DFS is useful for solving problems like finding connected components, detecting cycles, and solving mazes.
What people are saying about PayPal
Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
Repeat until the entire array is sorted
Paypal is a digital payment platform that allows individuals and businesses to make online transactions.
Paypal provides a secure way to send and receive money online.
It allows users to link their bank accounts, credit cards, or debit cards to their Paypal account.
Users can make payments to merchants or individuals using their Paypal balance or linked payment methods.
Paypal offers buyer and seller protection, dispu...
A program to reverse a singly linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
Dijkstra's algorithm finds the shortest path between nodes in a graph.
Create a graph with nodes and edges
Assign a tentative distance to each node
Set the initial node as current and mark it visited
For each neighbor of the current node, calculate the tentative distance
If the tentative distance is less than the current distance, update the distance
Mark the current node as visited and select the unvisited node with th...
Methods to find nth largest element in an unsorted linked list
Traverse the linked list and store elements in an array, sort the array and return the nth largest element
Use quickselect algorithm to find the nth largest element in O(n) time complexity
Implement a max heap and extract the nth largest element
Divide the linked list into smaller sublists and recursively find the nth largest element
Use merge sort to sort ...
Test cases for a bank transaction
Transaction amount within account balance limit
Transaction amount exceeds account balance limit
Transaction to a valid account number
Transaction to an invalid account number
Transaction with correct transaction code
Transaction with incorrect transaction code
Transaction during bank working hours
Transaction outside bank working hours
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There were 3 interview rounds.
Encryption of code involves converting plaintext into ciphertext to secure data.
Choose a strong encryption algorithm like AES or RSA
Generate a key for encryption
Encrypt the plaintext using the key and algorithm
Store or transmit the ciphertext securely
Abstraction is hiding the implementation details, function overriding is providing a new implementation for a method in a subclass.
Abstraction involves hiding the complex implementation details and showing only the necessary features to the user.
Function overriding occurs in inheritance when a subclass provides a specific implementation for a method that is already defined in its superclass.
Example: Parent class 'Anima...
I appeared for an interview in Mar 2025, where I was asked the following questions.
The problem involves counting the number of valid parentheses combinations in a string.
Use a stack to track opening parentheses and ensure they are matched with closing ones.
Count valid pairs as you traverse the string, e.g., '()' is valid, while '(()' is not.
Consider edge cases like empty strings or strings with no parentheses.
A React component can interact with the window object for various functionalities like resizing, scrolling, and event handling.
Use `window.addEventListener` to listen for events like resize or scroll.
Example: `window.addEventListener('resize', handleResize);`
Clean up event listeners in `componentWillUnmount` to prevent memory leaks.
Access window properties like `window.innerWidth` for responsive designs.
Use `window.loc...
Good Experience with friendly interviewer
Hackerrank - 1.5 hour
Design a system for managing a parking lot efficiently.
Use a database to store information about available parking spots, vehicles, and payments.
Implement a system for tracking entry and exit of vehicles.
Include features like online booking, payment options, and real-time availability updates.
Consider implementing a ticketing system for managing parking duration and fees.
Leetcode medium level qustion
I applied via Instahyre and was interviewed before Aug 2022. There were 5 interview rounds.
There 2 coding rounds one on online and other on one-one discussion, both including few problem solving on DS and Algo on topics of Trees, Priority Queue, Arrays, DFS
Implement a stack that supports retrieving the minimum element in constant time.
Use an auxiliary stack to keep track of minimum values.
Push the current minimum onto the auxiliary stack whenever a new element is pushed.
When popping an element, also pop from the auxiliary stack if it is the current minimum.
Example: For stack [3, 5, 2], min stack would be [3, 2].
To get min: simply return the top of the min stack.
Check if a given file path exists in the file system hierarchy and return the result.
Use file system APIs to check if the given file path exists in the hierarchy.
Traverse the file system hierarchy starting from the root directory to find the given file path.
Return true if the file path exists, false otherwise.
Design a parking system to manage vehicle parking efficiently and optimize space usage.
Define user roles: Admin, Driver, and Parking Attendant.
Implement features like real-time availability tracking and reservation.
Use sensors or cameras for automated entry/exit logging.
Integrate payment systems for seamless transactions.
Consider mobile app for users to find and reserve spots.
I appeared for an interview before Mar 2023.
This was back in 2015 so the coding test was very easy: it involved swapping of some numbers
I applied via Campus Placement and was interviewed in Jan 2022. There were 4 interview rounds.
2 coding question
Leetcode medium
Finding optimal path cost and path in a matrix using dynamic programming.
Dynamic programming is a technique to solve problems by breaking them down into smaller subproblems and solving them recursively.
In this case, we can use dynamic programming to find the optimal path cost and path in a matrix.
We can start by defining a 2D array to store the minimum cost of reaching each cell in the matrix.
Then, we can use a recursi...
In 2 years, I see myself as a senior software engineer, leading a team and contributing to the company's growth. I want to join the company because of its reputation for innovation and its focus on employee development.
I plan to continue learning and growing my skills in software development
I hope to take on more leadership responsibilities and mentor junior engineers
I want to contribute to the company's success by dev...
based on 13 interview experiences
Difficulty level
Duration
based on 29 reviews
Rating in categories
Software Engineer2
344
salaries
| ₹22.2 L/yr - ₹40 L/yr |
Software Engineer
340
salaries
| ₹19.1 L/yr - ₹41.7 L/yr |
Senior Software Engineer
299
salaries
| ₹24 L/yr - ₹42 L/yr |
Software Engineer III
281
salaries
| ₹30 L/yr - ₹51 L/yr |
Data Scientist
267
salaries
| ₹28 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard