PhonePe
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Instahyre and was interviewed in Nov 2024. There was 1 interview round.
Machine Coding round on codesignal
It was a machine coding round which revolves around designing a simple application primarily on OOPS
The best time to sell stocks is when the market is high and the stock has reached its peak value.
Sell when the stock has reached its peak value to maximize profits
Consider selling if the company's fundamentals have changed negatively
Sell if you need to rebalance your portfolio or have reached your financial goals
The best time to sell stocks is when the market is at a peak and the stock price is high.
Monitor market trends and stock performance regularly.
Consider selling when the stock reaches a new high or when you have achieved your profit goals.
Sell if there are negative news or events that could impact the stock price negatively.
I applied via Approached by Company and was interviewed in Jul 2024. There were 4 interview rounds.
The first round is an aptitude assessment that consists of coding questions focused on dynamic programming, as well as medium to hard level aptitude and reasoning questions.
The second round focuses on coding and consists of data structure and algorithm questions related to arrays, linked lists, basic Java concepts, strings, and project-based questions from the resume.
The third round also consists of coding, which includes challenging data structures and algorithms questions based on graphs, trees, multithreading, and difficult SQL-based questions.
My short-term goal is to enhance my skills in backend development and contribute effectively to the team. My long-term goal is to become a lead developer and work on innovative projects.
Short-term goal: Improve backend development skills
Short-term goal: Contribute effectively to the team
Long-term goal: Become a lead developer
Long-term goal: Work on innovative projects
I break down the problem into smaller tasks, prioritize them, and focus on the most critical aspects first.
Break down the problem into smaller, more manageable tasks
Prioritize tasks based on importance and impact
Focus on critical aspects first to ensure progress
Regularly reassess and adjust the plan as needed
I was interviewed before Jun 2023.
Program to read a file in backend development
Use a programming language like Python, Java, or C++ to open and read the file
Use file handling functions to read the contents of the file
Handle exceptions for file not found or permission issues
Close the file after reading to free up system resources
I applied via Instahyre and was interviewed in Jan 2021. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at a rate of one node per iteration and the other moving at a rate of two nodes per iteration.
If there is a loop in the linked list, the two pointers will eventually meet at some node.
To find the starting point of the loop, we reset one of the pointers to the head of the linked list and ...
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
Spring Boot offers advantages like rapid development, easy configuration, embedded servers, production-ready features, and more.
Rapid development: Spring Boot simplifies the setup and configuration of Spring applications, allowing developers to focus on writing business logic.
Easy configuration: Spring Boot provides auto-configuration, reducing the need for manual setup and boilerplate code.
Embedded servers: Spring Boo...
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
-----.geeksforgeeks.org/replace-every-element-with-the-greatest-on-right-side/amp/
-----/
I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.
Minimum cost to reach last cell of 2D matrix with only downward or right moves.
Use dynamic programming approach to solve the problem.
Calculate minimum cost for each cell by considering minimum cost of its adjacent cells.
Final answer will be the minimum cost to reach the last cell.
Design a stack that supports getMin functionality to return the minimum element in the stack.
Create two stacks, one for storing the actual elements and another for storing the minimum elements.
Push elements onto both stacks simultaneously.
When popping an element, pop from both stacks.
To get the minimum element, peek at the top of the minimum stack.
TreeSet is a data structure that stores unique elements in sorted order.
TreeSet is implemented using a Red-Black tree
It provides O(log n) time complexity for basic operations like add, remove, and contains
It also provides methods like first(), last(), headSet(), tailSet(), and subSet()
TreeSet can be used to implement priority queues and sorting algorithms
Design an ArrayList with getMax functionality.
Create a custom ArrayList class that extends the existing ArrayList class.
Add a getMax() method that returns the maximum value in the list.
Override the add() method to keep track of the maximum value in the list.
Update the maximum value whenever an element is added or removed from the list.
I was interviewed before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
Given an N x M
matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y)
and ends at the top left corner of t...
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where 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.
based on 2 interviews
Interview experience
Key Accounts Executive
645
salaries
| ₹0 L/yr - ₹0 L/yr |
Territory Sales Manager
518
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
491
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Associate
370
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
259
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
Google Pay
Amazon Pay
Mobikwik