Filter interviews by
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.
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...
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.
Design an AI-powered parking lot system for efficient space management and user convenience.
Utilize sensors and cameras to monitor parking space availability in real-time.
Implement a mobile app for users to find, reserve, and pay for parking spots.
Use machine learning algorithms to predict peak parking times and optimize space allocation.
Integrate with navigation systems to guide users to the nearest available par...
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 lik...
The system design of a circuit breaker involves determining the appropriate rating, type, and coordination with other protective devices.
Consider the voltage and current ratings to select the appropriate circuit breaker
Choose between thermal-magnetic, magnetic, or electronic trip units based on the application
Ensure proper coordination with upstream and downstream protective devices to prevent nuisance tripping
Fac...
The best complement I received from a customer was for my exceptional problem-solving skills and dedication to providing excellent service.
Customer praised my quick response and resolution to their issue
Customer appreciated my friendly and helpful attitude
Customer mentioned my attention to detail and going above and beyond to assist them
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' t...
I appeared for an interview in Aug 2017.
The program reads a file and selects the first 3 lines. It then identifies the longest line and counts the number of words in that line.
Read the file using appropriate file handling methods
Store the first 3 lines in an array of strings
Iterate through the array to find the longest line
Count the number of words in the longest line using string manipulation methods
Find the shortest palindrome in an array of strings using O(n^2) time complexity.
A palindrome reads the same forwards and backwards, e.g., 'racecar'.
Iterate through each string in the array and check if it's a palindrome.
Keep track of the shortest palindrome found during the iteration.
Example: For ['abc', 'a', 'aba', 'xyz'], the shortest palindrome is 'a'.
Use two pointers to check for palindrome properties efficiently.
The question is about finding the shortest path in a 3x3 matrix with weighted edges.
This is a graph traversal problem.
Use a graph algorithm like Dijkstra's algorithm or A* search to find the shortest path.
Assign weights to the edges and calculate the sum of weights for each possible path.
Choose the path with the smallest sum of weights as the shortest path.
The Fibonacci series can be applied in day-to-day life for various purposes.
Financial planning: Fibonacci numbers can be used to calculate investment growth and determine optimal investment strategies.
Architecture and design: Fibonacci ratios can be used to create aesthetically pleasing designs and layouts.
Nature and biology: Fibonacci patterns can be observed in the growth of plants, arrangement of leaves, and formati...
Typing www.google.com initiates a series of network requests to load the webpage in your browser.
1. DNS Resolution: The browser queries a DNS server to translate www.google.com into an IP address.
2. TCP Connection: A TCP connection is established with the server using the IP address.
3. HTTP Request: The browser sends an HTTP request to the server for the webpage.
4. Server Response: The server processes the request and ...
To check internet connectivity, you can use various methods like pinging a website or checking network status.
Use the command 'ping www.google.com' to see if you receive a response.
Check network settings in your operating system for connectivity status.
Use tools like 'traceroute' to diagnose network paths and issues.
In programming, use libraries like 'requests' in Python to attempt a web request.
Use a MinHeap to efficiently find the kth largest element in an array.
1. Create a MinHeap of size k to store the largest k elements.
2. Iterate through the array, adding elements to the MinHeap.
3. If the size of the MinHeap exceeds k, remove the smallest element.
4. After processing all elements, the root of the MinHeap is the kth largest element.
Example: For array [3, 2, 1, 5, 6, 4] and k=2, the MinHeap will contain [5,...
Amazon displays only a subset of search results based on various factors like relevance, popularity, and user preferences.
Amazon uses algorithms to determine which products to display in search results.
Factors considered include product relevance, customer reviews, sales rank, and availability.
Machine learning techniques may be used to personalize search results based on user behavior and preferences.
Amazon also consid...
Hash tables are a data structure that uses a hash function to map keys to values, providing efficient lookup, insertion, and deletion.
Hash tables use a hash function to convert keys into array indices.
They provide constant-time average case complexity for search, insert, and delete operations.
Collisions can occur when different keys map to the same index, which can be resolved using techniques like chaining or open add...
The product will be the key and the brands will be the values.
The key in this case refers to the unique identifier for each product.
The values are the different brands associated with each product.
For example, if the product is a smartphone, the key could be the model number and the values could be the different brands that manufacture that model.
Radix sort is a sorting algorithm that sorts integers by processing individual digits from least significant to most significant.
Radix sort is a non-comparative sorting algorithm.
It sorts numbers by grouping them based on each digit's value.
It is commonly used for sorting strings in lexicographic order.
Radix sort has linear time complexity, making it efficient for large datasets.
Radix sort has a running time of O(nk), where n is the number of elements and k is the length of the longest element.
Radix sort is a non-comparative sorting algorithm that sorts elements by their individual digits or characters.
It works by distributing the elements into 10 buckets based on the value of the least significant digit, then repeatedly redistributing them based on the next significant digit.
The process conti...
O(nk) is better than O(n) for large data and hash tables.
O(nk) is better because it takes into account the size of the data and the number of keys.
For large data and hash tables, the size of n will be large, making O(nk) more efficient.
O(n) assumes a constant number of keys, which may not be the case in practice.
Amazon may have chosen O(nk) for better scalability and performance.
I have worked on various projects including a web application for tracking fitness goals and a mobile app for managing personal finances.
Developed a web application using React and Node.js to track fitness goals and progress
Created a mobile app using Flutter to manage personal finances and budgeting
Collaborated with a team to implement features, fix bugs, and optimize performance
If not selected for PayPal, I will continue applying to other companies, improve my skills, and network with professionals in the industry.
Continue applying to other tech companies for similar roles
Work on improving technical skills through online courses or personal projects
Network with professionals in the industry through events or online platforms like LinkedIn
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
Top trending discussions
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 158 interview experiences
Difficulty level
Duration
Software Engineer2
339
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer
325
salaries
| ₹13.5 L/yr - ₹45 L/yr |
Senior Software Engineer
294
salaries
| ₹15.4 L/yr - ₹46.6 L/yr |
Software Engineer III
283
salaries
| ₹20 L/yr - ₹70 L/yr |
Data Scientist
263
salaries
| ₹15 L/yr - ₹65 L/yr |
Paytm
Razorpay
Visa
MasterCard