Filter interviews by
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.
MongoDB is scalable due to its ability to horizontally partition data across multiple servers.
MongoDB uses sharding to distribute data across multiple servers.
Sharding allows for horizontal scaling by adding more servers to the cluster.
MongoDB also supports replica sets for high availability and fault tolerance.
Indexes can be created on any field in a MongoDB document, allowing for efficient querying of large data...
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.
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 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 'GRA...
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
Hackerrank - 1.5 hour
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.
MongoDB is scalable due to its ability to horizontally partition data across multiple servers.
MongoDB uses sharding to distribute data across multiple servers.
Sharding allows for horizontal scaling by adding more servers to the cluster.
MongoDB also supports replica sets for high availability and fault tolerance.
Indexes can be created on any field in a MongoDB document, allowing for efficient querying of large datasets.
I appeared for an interview 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.
Top trending discussions
I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.
posted on 11 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 5 interview rounds.
I applied via Company Website and was interviewed before Jan 2021. There were 3 interview rounds.
Routing through a proxy involves configuring the proxy server to forward requests to the destination server.
Configure the proxy server to listen for incoming requests
Configure the proxy server to forward requests to the destination server
Configure the client to use the proxy server for outgoing requests
Use a proxy server to bypass network restrictions or improve performance
Examples: Nginx, Apache, Squid
Design an MVC controller system to route URLs to the appropriate controllers based on the URL structure.
Define a routing mechanism that maps URLs to controller actions.
Use a hierarchical structure where each segment of the URL corresponds to a controller.
Example: For 'xyz.com/a/b/c', 'a' routes to 'AController', 'b' to 'BController', and 'c' to 'CController'.
Implement a method to parse the URL and invoke the correspond...
Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.
Autocomplete should suggest code snippets based on the context of the code being written
Autocomplete should prioritize suggestions based on frequency of use
Autocomplete should also suggest variable and function names
Autocomplete should be customizable to allow for user-defined snippets and suggestions
Exa...
My weakness is public speaking.
I tend to get nervous when speaking in front of large groups.
I am working on improving my public speaking skills by practicing and seeking feedback.
I have taken courses and attended workshops to help me overcome my fear of public speaking.
Comparing 2 basketball game scenarios with different number of trials and baskets required to win
Calculate the probability of winning in each game scenario using binomial distribution formula
Compare the probabilities to determine which game scenario is preferable
In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets
If p is high, game1 is pref...
I want to join Visa to contribute to innovative payment solutions and be part of a global leader in financial technology.
Visa is at the forefront of digital payment innovation, allowing me to work on cutting-edge technologies.
The company's commitment to security aligns with my passion for developing secure software solutions.
Visa's global presence offers opportunities to collaborate with diverse teams and learn from di...
I'm a passionate software engineer with a strong background in full-stack development and a love for problem-solving.
Graduated with a degree in Computer Science from XYZ University.
Worked at ABC Corp, where I developed a web application that improved user engagement by 30%.
Proficient in languages like JavaScript, Python, and Java, with experience in frameworks like React and Django.
Enjoy collaborating in agile teams an...
Some of the top questions asked at the PayPal Software Engineer interview for freshers -
based on 2 interview experiences
Difficulty level
Duration
based on 29 reviews
Rating in categories
Software Engineer2
345
salaries
| ₹22.2 L/yr - ₹40 L/yr |
Software Engineer
330
salaries
| ₹14 L/yr - ₹48 L/yr |
Senior Software Engineer
304
salaries
| ₹23.7 L/yr - ₹42 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