Filter interviews by
I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.
System design of large scale system involves designing the architecture, components, and interactions of a complex software system.
Identify the requirements and constraints of the system
Break down the system into smaller components/modules
Design the interactions between components using APIs and protocols
Consider scalability, reliability, and performance
Use distributed systems principles for fault tolerance and load ba
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Paypal is a leading online payment platform with a strong reputation and global presence.
Paypal is a well-established and trusted online payment platform used by millions of users worldwide.
It offers secure and convenient payment options for both individuals and businesses.
Paypal has a strong focus on innovation and technology, making it an exciting place to work for software engineers.
Working at Paypal provides opport...
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, dispute re...
In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.
Continuing to enhance my technical skills and knowledge through ongoing learning and certifications
Taking on more leadership responsibilities and mentoring junior team members
Contributing to the development of cutting-edge software solutions
Building strong relationships with colleagues and stakeholders to drive pr
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 applied via Campus Placement
I applied via Referral
My biggest achievement till date is successfully leading a team to develop and launch a new software product ahead of schedule.
Led a team of developers to create a new software product
Completed the project ahead of schedule
Received positive feedback from clients and stakeholders
I would address conflicts directly and respectfully, seeking to understand the root cause and find a mutually beneficial solution.
Listen actively to understand the other person's perspective
Communicate clearly and respectfully
Identify the root cause of the conflict
Brainstorm potential solutions together
Be willing to compromise and find a mutually beneficial solution
Success is achieving personal goals, feeling fulfilled, and making a positive impact.
Success is subjective and can vary from person to person.
It involves setting and achieving goals, both short-term and long-term.
Feeling fulfilled and content with one's accomplishments is a key aspect of success.
Making a positive impact on others or the world can also be a measure of success.
Success is not just about material wealth or...
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 the sma...
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
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 the l
A prime number is a number that is divisible only by 1 and itself.
A prime number has exactly two factors: 1 and itself.
Prime numbers cannot be divided evenly by any other number.
Examples of prime numbers include 2, 3, 5, 7, 11, 13, 17, etc.
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
Design classes for educational institutions in a city
Identify the main entities: schools, students, teachers, courses
Create a School class with attributes like name, address, and a list of students and teachers
Create a Student class with attributes like name, age, and a list of courses
Create a Teacher class with attributes like name, specialization, and a list of courses
Create a Course class with attributes like name, ...
I was interviewed before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
This was an online test for 90 minutes. 2 programming questions and MCQs related to CS fundamentals were asked.
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.
If one of the pointers reaches the end of the list (null), it means there is no cycle.
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 stri...
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.
Round duration - 60 minutes
Round difficulty - Medium
Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal problem on an undirected and disconnected graph to find connected components.
Perform Depth First Search (DFS) on each vertex to find connected components
Use a visited array to keep track of visited vertices
Print the number of connected components and list vertices in ascending order for each component
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 determi...
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 graphs an
Round duration - 60 minutes
Round difficulty - Medium
Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Implement the Merge Sort algorithm using a Divide and Conquer approach
Recursively divide the input array into two halves until the size of each array is 1
Merge the sorted halves to produce a completely sorted array
Ensure the output is in non-descending order
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
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 Python
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.:
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round where the interviewer asked questions based on Data structures and algorithms.
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes.
Use three pointers to keep track of the current, previous, and next nodes.
Update the links between nodes to reverse the list.
Return the head of the reversed linked list.
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 disc...
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round where the interviewer asked questions based on Data structures and algorithms.
Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.
The absolute...
Sort a Singly Linked List based on actual values instead of absolute values.
Traverse the linked list and store the values in an array.
Sort the array based on actual values.
Update the linked list with the sorted values.
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, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order to easily find the Kth largest element.
Ensure all elements in the array are distinct for accurate results.
Handle multiple test cases efficiently by iterating through each case.
Round duration - 30 minutes
Round difficulty - Easy
HR Round that lasted for around 30 minutes. The interviewer asked questions to know more about me.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Easy
The interview was held in the evening on a weekday, Interview was nice and quite experienced, he asked me about my previous experience in the area and they told me about the team and work for which they were hiring, we did some discussion on that. Meanwhile, I was also asked a few questions on Database and SQL.
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...
Find the magic index in a sorted array where A[i] = i.
Iterate through the array and check if A[i] = i for each index i
Utilize binary search for a more efficient solution
Handle cases where there are multiple magic indices or none at all
Round duration - 60 minutes
Round difficulty - Medium
The interview was in the afternoon. There were some glitches with the teams meeting but it got sorted out in a few minutes. This round was purely coding based. He started with questions on arrays, linked lists, and string manipulation with an increasing level of hardness. The tricky part was that the online editor I was given for writing the code was not an IDE but a simple text editor, so I wasn't getting any help in terms of code completion or syntax errors or syntax highlighting.
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
The task is to find all pairs of elements in an array that add up to a given target.
Iterate through the array and for each element, check if the difference between the target and the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Tip 1 : Always keep your focus on learning the basics, they should be rock solid
Tip 2 : Don't try to cram things days or weeks before interviews, that never helps. Try to learn little by little every day incrementally.
Tip 3 : Don't try to target any specific company, it almost never works out, just stay true to yourself and keep doing the hard work, opportunity will come to you eventually.
Tip 4 : If you need to prepare in a short time, I would suggest doing the 30-day interview challenge on Leetcode
Tip 1 : Keep it short and simple, don't clutter with lots of text, try to convey things using bullet points instead of paragraphs
Tip 2 : Don't use fancy graphics and make sure the resume is not more than 1 page (or maybe 2 in case you have more experience)
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
2 Codes on Hackerrank
posted on 10 Jan 2025
MVVM was asked and swift questions
based on 1 interview
Interview experience
KYC Associate
140
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Collections Executive
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Executive
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Service Executive
25
salaries
| ₹0 L/yr - ₹0 L/yr |
ZestMoney
Paysense Services India
EarlySalary Services
Kissht Finance