Filter interviews by
A payment processing system facilitates secure transactions between customers and merchants, ensuring efficiency and reliability.
User Authentication: Verify user identity through secure login methods (e.g., 2FA).
Payment Gateway Integration: Connect with gateways like Stripe or PayPal for transaction processing.
Transaction Security: Implement encryption (e.g., SSL) to protect sensitive data.
Fraud Detection: Use alg...
Efficiently search for an element in a sorted 2D matrix using binary search techniques.
The matrix is sorted both row-wise and column-wise.
Start from the top-right corner of the matrix.
If the target is less than the current element, move left.
If the target is greater, move down.
Continue until the target is found or bounds are exceeded.
Example: In a matrix [[1, 3, 5], [7, 9, 11], [12, 14, 16]], searching for 9 retur...
My KPIs focused on customer satisfaction, response time, and team performance metrics to enhance service quality.
Customer Satisfaction Score (CSAT): Achieved an average score of 90% through regular feedback surveys.
First Response Time: Reduced average response time to under 2 hours, improving customer engagement.
Team Performance: Conducted monthly training sessions, resulting in a 15% increase in team efficiency.
Generate a spiral matrix from a given 2D array, traversing elements in a spiral order.
Start from the top-left corner and move right until the end of the row.
Then, move down the last column.
Next, move left across the bottom row.
Finally, move up the first column.
Repeat the process for the inner layers until all elements are traversed.
Example: For a 3x3 matrix, the output would be [1, 2, 3, 6, 9, 8, 7, 4, 5].
What people are saying about PayPal
Implement a sorting algorithm from scratch without using built-in functions.
Choose a sorting algorithm: Bubble Sort, Selection Sort, or Insertion Sort.
Bubble Sort: Repeatedly swap adjacent elements if they are in the wrong order.
Example of Bubble Sort: [5, 3, 8, 4] becomes [3, 4, 5, 8].
Selection Sort: Find the minimum element and swap it with the first unsorted element.
Example of Selection Sort: [64, 25, 12, 22, 1...
Constructing a tree of strings involves organizing data hierarchically, where each string can have multiple child strings.
Define a TreeNode class: Create a class to represent each node in the tree, containing a string value and a list of child nodes.
Build the tree: Iterate through the input array, adding each string to the appropriate parent node based on a defined relationship.
Example structure: For an input arra...
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if needed.
Bubble sort works by repeatedly passing through the array and comparing adjacent elements.
If the first element is greater than the second, they are swapped. This process is repeated until no swaps are needed.
Example: For the array ['apple', 'orange', 'banana'], after one pass, it b...
Detecting a loop in a linked list is crucial for preventing infinite traversal and ensuring efficient memory usage.
Floyd's Cycle Detection Algorithm: This algorithm uses two pointers, slow and fast, to traverse the list. If they meet, a loop exists.
Time Complexity: The algorithm runs in O(n) time, where n is the number of nodes in the linked list, making it efficient.
Space Complexity: It uses O(1) space since it o...
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 `windo...
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.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
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
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.
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
Hashing is a process of converting data into a fixed-size numerical value called a hash code.
Hashing is used to quickly retrieve data from large datasets.
It is commonly used in data structures like hash tables and hash maps.
Hash functions should be fast, deterministic, and produce unique hash codes for different inputs.
Examples of hash functions include MD5, SHA-1, and SHA-256.
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
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
I want to join PayPal because of its innovative technology, global impact, and strong company culture.
Innovative technology - PayPal is known for its cutting-edge technology and digital payment solutions.
Global impact - Working at PayPal would allow me to contribute to a company that has a worldwide reach and influence.
Strong company culture - I value a company that prioritizes diversity, inclusion, and employee well-b...
I recently learned about the benefits of using Docker for containerization.
Docker allows for easy packaging and deployment of applications
It helps in creating consistent environments across different platforms
Docker containers are lightweight and efficient
Example: I used Docker to containerize a microservices architecture for a recent project
I appeared for an interview in Jan 2025.
One question related to object-oriented programming and one question related to data structures and algorithms.
The system design for the checkout feature on Amazon involves request body, API calls, load balancing, database caching, and CDN considerations.
Request body includes user's selected items, shipping address, payment details, etc.
API calls are made to process payment, update inventory, and send confirmation emails.
Load balancing ensures even distribution of traffic across multiple servers to handle checkout requests effi...
I appeared for an interview in Feb 2025, where I was asked the following questions.
Design a system to collect contacts and send invitations via phone or email.
Collect contacts using mobile APIs (e.g., Android Contacts API, iOS Contacts Framework).
Store contacts in a secure database (e.g., Firebase, AWS DynamoDB).
Implement user authentication for privacy (e.g., OAuth, JWT).
Create a user interface for selecting contacts and composing invitations.
Send invitations via SMS or email using services like Twi...
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
KNN algorithm is a simple and effective machine learning algorithm for classification and regression tasks.
KNN stands for K-Nearest Neighbors.
It is a non-parametric, lazy learning algorithm.
Works by finding the K closest training examples in feature space to a given input data point.
Classification: Assign the most common class among the K nearest neighbors.
Regression: Take the average of the K nearest neighbors' target...
Understanding prefix and suffix problems in strings is crucial for efficient algorithm design.
A prefix is a substring that starts from the beginning of the string. Example: In 'hello', 'he' is a prefix.
A suffix is a substring that ends at the end of the string. Example: In 'hello', 'lo' is a suffix.
Common problems include finding the longest common prefix or suffix among an array of strings.
For example, given ['flower'...
I applied via Referral and was interviewed in Nov 2024. There were 3 interview rounds.
Data structures and algo. 2 ques were asked in hackerrank
I applied via LinkedIn
Question base on Tree data structures
GC collector in Java is responsible for managing memory by reclaiming unused objects and freeing up memory space.
GC stands for Garbage Collector
Automatically manages memory by reclaiming unused objects
Prevents memory leaks and optimizes memory usage
Different types of GC algorithms like Serial, Parallel, CMS, G1
Example: System.gc() can be used to suggest garbage collection
Design a car rental system at a low level
Use object-oriented programming to model cars, customers, rentals, etc.
Implement a database to store information about available cars, customer bookings, etc.
Include features like booking, returning, and searching for cars
Consider implementing a pricing system based on factors like car type, duration of rental, etc.
I applied via Recruitment Consulltant
Ask about how to implement DQ
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Coding questions on DSA
I appeared for an interview in May 2025, where I was asked the following questions.
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 applied via LinkedIn and was interviewed in Nov 2024. There were 3 interview rounds.
Coding test was on HackerRank
Some of the top questions asked at the PayPal interview -
The duration of PayPal interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 160 interview experiences
Difficulty level
Duration
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