Filter interviews by
I applied via Approached by Company and was interviewed before Jul 2023. There was 1 interview round.
Sort an array of strings containing only 0s, 1s, and 2s.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values of the pointers.
Example: Input array = ['1', '0', '2', '1', '0'], Output array = ['0', '0', '1', '1', '2']
Find the longest palindromic substring within a given string.
Iterate through each character in the string and expand around it to find palindromes.
Keep track of the longest palindrome found so far.
Consider both odd and even length palindromes.
Top trending discussions
I applied via Approached by Company and was interviewed before Jul 2023. There were 4 interview rounds.
MVC architecture separates an application into Model, View, and Controller components for better organization and scalability.
Model represents the data and business logic
View displays the data to the user
Controller handles user input and updates the model
Example: Model - User class with properties like name, email; View - HTML template to display user info; Controller - User controller to handle user actions
Strengths - problem-solving, teamwork, communication. Weaknesses - perfectionism, time management.
Strengths: problem-solving - I enjoy tackling complex problems and finding creative solutions.
Strengths: teamwork - I work well with others and value collaboration in achieving common goals.
Strengths: communication - I am able to effectively communicate technical concepts to non-technical stakeholders.
Weaknesses: perfectio...
I applied via Naukri.com and was interviewed in Sep 2021. There were 4 interview rounds.
Count the number of flips required to convert a binary string to alternate 0 and 1.
Iterate through the string and count the number of flips required to make it alternate.
Keep track of the current character and the expected character.
Example: 001101 -> 010101 requires 2 flips.
Example: 101010 -> 010101 requires 3 flips.
Find the maximum profit from buying and selling a stock given an array of its values.
Iterate through the array and keep track of the minimum value seen so far.
Calculate the profit at each index and update the maximum profit seen.
Return the maximum profit.
Boundary traversal of a tree
Boundary traversal involves visiting the nodes on the boundary of a tree in a specific order
Start with the root node and traverse the left boundary, then the leaf nodes from left to right, and finally the right boundary
Use recursion to traverse the left and right subtrees
Exclude the leaf nodes that are also part of the left or right boundary
Reverse a linked list in groups of k nodes.
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
Use recursion or iteration to implement the solution
I appeared for an interview before Jun 2024, where I was asked the following questions.
Create a reusable modal component in React for displaying content dynamically.
Use functional components and hooks for state management.
Implement props for dynamic content: title, body, and actions.
Utilize CSS for styling and transitions for better UX.
Include accessibility features like ARIA roles.
Example: <Modal title='Confirm' body='Are you sure?' onConfirm={handleConfirm} />
I appeared for an interview in Mar 2025, where I was asked the following questions.
Swap the kth node from the start with the kth node from the end in a linked list.
Identify the kth node from the start and end of the linked list.
Traverse the list to find the kth node from the start.
Simultaneously traverse to find the kth node from the end.
Swap the values of the two identified nodes.
Consider edge cases: if k is greater than the length of the list.
Find the smallest substring in a string that contains all characters of another string.
Use two pointers to maintain a sliding window over the string.
Track character counts of the target string using a hash map.
Expand the window by moving the right pointer until all characters are included.
Shrink the window by moving the left pointer to find the minimum length.
Example: For s = 'ADOBECODEBANC' and t = 'ABC', the result i...
Aptitude test was on hacker earth
No coding test was taken by the interviewrrwe
I appeared for an interview before Oct 2022.
Asked dome simple LinkedIn list and array questions.
I appeared for an interview in Sep 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round where the interviewer asked me 2 DSA based problems.
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks at different points.
Keep track of the maximum profit that can be achieved by considering all possible combinations of buy and sell transactions.
Ensure that y...
Ninja is practicing binary representations and stumbled upon an interesting problem. Given two numbers 'A' and 'B', you are required to determine how many bits need t...
Calculate the number of bit flips required to convert one number to another in binary representation.
Convert both numbers to binary representation
Count the number of differing bits between the two numbers
Output the count of differing bits as the number of bit flips required
Example: A = 13 (1101), B = 7 (0111) -> 2 bit flips required
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round where the interviewer asked me 2 DSA based problems.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in top-down order
Traverse the leaf nodes in left-right order
Traverse the right boundary nodes in bottom-up order
Handle cases where duplicates occur in boundary nodes
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
Reverse a linked list in groups of size K by reversing nodes in each group.
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the number of elements in the last group is less than K
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round where the interviewer asked behavioral problems.
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.
Design a high-level architecture for a scalable online bookstore platform.
Use microservices architecture for modularity and scalability.
Implement a RESTful API for communication between frontend and backend services.
Utilize a relational database (e.g., PostgreSQL) for storing book and user data.
Incorporate a caching layer (e.g., Redis) to improve performance for frequently accessed data.
Consider using a message broker ...
Design a URL shortening service like Bitly that generates short links for long URLs.
Define the core functionality: generate, retrieve, and delete short URLs.
Use a hash function to create unique short links from long URLs.
Implement a database to store mappings of short URLs to long URLs.
Consider user authentication for tracking link usage and analytics.
Implement rate limiting to prevent abuse of the service.
based on 1 interview experience
Difficulty level
Duration
Assistant Manager
265
salaries
| ₹4.8 L/yr - ₹18 L/yr |
Senior Executive
265
salaries
| ₹3.9 L/yr - ₹8.4 L/yr |
Beauty Advisor
208
salaries
| ₹1.7 L/yr - ₹5 L/yr |
Business Development Executive
175
salaries
| ₹2 L/yr - ₹4.6 L/yr |
Store Manager
131
salaries
| ₹4.1 L/yr - ₹10 L/yr |
Amazon
Flipkart
Indiamart Intermesh
Udaan