Filter interviews by
C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.
C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.
C does not support classes and objects, while C++ does.
C does not have features like inheritance and polymorphism, which are present in C++.
C is a subset of C...
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X, ...
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.
Use a priority queue to efficiently select the next node with the shortest distance.
Update the distances of neighboring nodes based on the current node's distance and edge weights.
Handle...
Query to find the nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to select the nth highest salary
Consider handling cases where there may be ties for the nth highest salary
Stack is used for static memory allocation and stores local variables, while Heap is used for dynamic memory allocation and stores objects.
Stack is faster than Heap as it has a fixed size and memory allocation is done at compile time.
Heap is slower than Stack as memory allocation is done at runtime and requires more complex management.
Stack memory is limited and typically smaller in size, while Heap memory is larg...
What people are saying about PayPal
Design a Cinema Ticket Reservation System
Use a database to store movie information, showtimes, and seat availability
Allow users to search for movies, select showtimes, and choose seats
Implement a payment system for ticket purchases
Send confirmation emails with QR codes for ticket validation
OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOP focuses on creating objects that interact with each other to solve problems.
Key concepts include encapsulation, inheritance, and polymorphism.
Encapsulation involves bundling data and methods that operate on the data into a single unit.
Inheritance allows classes to inher...
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, 8...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
SQL query to find the nth highest salary
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries
Combine the above steps in a single query to find the nth highest salary
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line con...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are overridden in derived classes using the 'override' keyword.
They allow a function to be called based on the runtime type of an object.
Virtual functions enable dynamic binding and late binding in C++.
Example: virtual ...
I applied via LinkedIn and was interviewed in Nov 2024. There were 3 interview rounds.
Coding test was on HackerRank
I appeared for an interview in Oct 2024.
Design a rate limiter to control the number of requests a user can make in a given time frame.
Define rate limiting strategies: Fixed Window, Sliding Window, Token Bucket.
Use a data store (e.g., Redis) to track request counts per user.
Implement a reset mechanism to clear counts after the time window.
Consider edge cases like burst traffic and user authentication.
Example: Allow 100 requests per hour per user.
I appeared for an interview in Mar 2025, where I was asked the following questions.
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).
Hackerrank - 1.5 hour
Basic questions of DSA were asked
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.
1 coding ques on trees,discussion on project,oops concept,sql query,webd related discussion
I applied via Naukri.com and was interviewed before Feb 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Aug 2022. There were 2 interview rounds.
Some of the top questions asked at the PayPal interview for freshers -
The duration of PayPal interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 11 interview experiences
Difficulty level
Duration
Software Engineer2
345
salaries
| ₹22.2 L/yr - ₹40 L/yr |
Software Engineer
338
salaries
| ₹19.2 L/yr - ₹40 L/yr |
Senior Software Engineer
298
salaries
| ₹24 L/yr - ₹42 L/yr |
Software Engineer III
283
salaries
| ₹30 L/yr - ₹51.2 L/yr |
Data Scientist
273
salaries
| ₹28 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard