Filter interviews by
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 ...
You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.
Divide the 10 balls into two groups of 5 each.
Weigh the two groups on the balance scale.
If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.
Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.
Weigh the two groups on the...
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters in...
Remove duplicate occurrences of characters in a given string.
Use a hash set to keep track of characters seen so far.
Iterate through the string and add non-duplicate characters to a new string.
Return the new string without duplicate characters.
Given two strings, A
and B
, determine whether A
can be transformed into B
by performing at most one of the following operations (including zero operations):
1. Delete a cha...
Determine if one string can be transformed into another by performing at most one operation (insert, delete, replace).
Iterate through both strings simultaneously and check for differences.
Handle cases where a character needs to be inserted, deleted, or replaced.
Keep track of the number of operations performed and ensure it does not exceed one.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"ed...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the input string length and number of test cases.
Given an array ARR
of N
elements, your task is to find the maximum difference between any two elements in ARR
.
If the maximum difference is even, print EVEN; if it is ...
Find the maximum difference between any two elements in an array and determine if it is even or odd.
Iterate through the array to find the maximum and minimum elements
Calculate the difference between the maximum and minimum elements
Check if the difference is even or odd and return the result
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determin...
Detect cycles in an undirected graph with given vertices and edges.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited array to keep track of visited vertices and a parent array to keep track of the parent of each vertex.
If while traversing, you encounter a visited vertex that is not the parent of the current vertex, then a cycle exists.
Consider edge cases like disconnected grap...
Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.
Hashing is used to securely store passwords by converting them into a hash value before storing in a database.
Hashing is used in data structures like hash tables to quickly retrieve data based on a key.
Common hash functions include MD5, SHA-1, and SHA-256.
Hashing can be implemented in programming languages like Py...
Given a string ‘str’, find the minimum number of partitions needed such that every segment of the string is a palindrome.
The task is to make cuts in the strin...
Find the minimum number of partitions needed in a string such that every segment is a palindrome.
Iterate through the string and check for palindromes at each possible partition point.
Use dynamic programming to keep track of the minimum cuts needed.
Consider edge cases where the string is already a palindrome or consists of different characters only.
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
1 coding ques on trees,discussion on project,oops concept,sql query,webd related discussion
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 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.
Top trending discussions
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
340
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer
330
salaries
| ₹14 L/yr - ₹48 L/yr |
Senior Software Engineer
293
salaries
| ₹15.4 L/yr - ₹46.6 L/yr |
Software Engineer III
284
salaries
| ₹20 L/yr - ₹66 L/yr |
Data Scientist
265
salaries
| ₹18.5 L/yr - ₹65 L/yr |
Paytm
Razorpay
Visa
MasterCard