Filter interviews by
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 ...
Floyd's algorithm can be used to solve this question.
Define two pointers slow and fast. Both point to the head node, fast is twice as fast as slow. There will be no cycle if it reaches the end. Otherwise, it will eventually catch up to the slow pointer somewhere in the cycle.
Let X be the distance from the first node to the node where the cycle begins, and let X+Y be the distance the slow pointer travels. To catch up, t...
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...
The problem can be solved using recursion. If the given string is a palindrome, 0 cuts are needed. Otherwise, try making cuts at all possible positions and calculate the cost for each cut recursively and take the minimum of all costs.
// i is the starting index and j is the ending index. Initially, i=0 and j=n-1
minCuts(str, i, j) = 0 if i == j // When string is of length 1.
minCuts(str, i, j) = 0 if str[i..j] is pa...
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...
The DFS algorithm is a recursive algorithm based on the idea of backtracking. It starts with the initial node of the graph G, and then goes to deeper and deeper until we find the goal node or the node which has no children.
Pseudocode :
DFS(G, s):
mark s as visited
for all neighbors v of s in Graph G:
if v is not visited:
DFS-recursive(G, v)
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...
DFS can be used to detect cycle in an undirected graph. Do a DFS traversal of the given graph. For every visited vertex ‘v’, if there is an adjacent ‘u’ such that u is already visited and u is not parent of v, then there is a cycle in graph.
If we don’t find such an adjacent for any vertex, we say that there is no cycle.
Pseudocode :
DetectCycle(graph, v, visited[], parent)
{
// mark the current node as visited
visited[v] = ...
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...
It works on the principle of Divide and Conquer. Merge sort repeatedly divides the array into several arrays until each array consists of a single element and merging those arrays in a manner that results into a sorted array.
Pseudocode :
MergeSort(A, p, r):
if p > r
return
q = (p+r)/2
mergeSort(A, p, q)
mergeSort(A, q+1, r)
merge(A, p, q, r)
Merge function : The task is to merge two subarrays A[p..q] and A[q+1..r] to ...
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...
Recursively call the function and find the maximum number of the submatrix and update the answer for every element of the matrix.
Algorithm:-
Hashing is a technique of mapping keys, values into the hash table by using a hash function. It is done for faster access to elements.
Hashing is implemented in two steps:
An element is converted into an integer by using a hash function. This element is used as an index to store the original element, which falls into the hash table.
The element is stored in the hash table where it can be quickly retrieved using hashed key
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 applied via campus placement at Indian Institute of Technology (IIT), Chennai 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 at Indian Institute of Technology (IIT), Chennai 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 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, ...
PayPal interview questions for designations
I applied via campus placement at Indian Institute of Technology (IIT), Chennai
Get interview-ready with Top PayPal Interview Questions
Top trending discussions
2 Interview rounds
based on 25 reviews
Rating in categories
Software Engineer2
286
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer III
247
salaries
| ₹17 L/yr - ₹66 L/yr |
Software Engineer
242
salaries
| ₹13.5 L/yr - ₹50 L/yr |
Senior Software Engineer
228
salaries
| ₹15 L/yr - ₹53 L/yr |
Risk Analyst
165
salaries
| ₹4.8 L/yr - ₹11 L/yr |
Paytm
Razorpay
Visa
MasterCard