Filter interviews by
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and evict it when the cache reaches its capacity.
Update the position of an item in the cache when it is accessed or updated.
Handle both get and put operations efficiently to maintain...
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...The task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize two pointers, one for arrival and one for departure.
Increment the platform count when a train arrives and decrement when it departs.
Keep track of the maximum platform count needed.
Return the maximum platform count as the minimum num
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with DSA based questions.
You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.
The first line of input contai...
Reverse a given singly linked list by changing 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
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 appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
Your task is to create a deep copy of a linked list, where each node has two pointers: one that points to the next node in the list, and a 'random' pointer which can ...
Create a deep copy of a linked list with random pointers.
Iterate through the original linked list and create a new node for each node in the list.
Store the mapping of original nodes to their corresponding new nodes.
Update the next and random pointers of the new nodes based on the mapping.
Return the head of the newly created deep copied linked list.
Round duration - 60 Minutes
Round difficulty - Medium
Given two strings S
and X
containing random characters, the task is to find the smallest substring in S
which contains all the characters present in X
.
The first...
The task is to find the smallest substring in string S which contains all the characters present in string X.
Iterate through string S and keep track of characters in X using a hashmap
Use two pointers to maintain a sliding window with all characters from X
Update the window size and start index when a valid window is found
Given a binary tree, connect all adjacent nodes at the same level by populating each node's 'next' pointer to point to its next right node. If there is no nex...
Connect adjacent nodes at the same level in a binary tree by populating each node's 'next' pointer.
Traverse the tree level by level using a queue.
For each node, connect it to the next node in the queue.
Set the 'next' pointer of the last node in each level to NULL.
Use constant extra space and do not alter the node structure.
Round duration - 60 Minutes
Round difficulty - Easy
You are given a string 'S' that represents a number. Your task is to find the closest palindromic number to this integer represented by 'S'. The closest number is defi...
Find the closest palindromic number to a given integer represented by a string.
Convert the string to an integer and iterate to find the closest palindromic number.
Check for palindromic numbers by reversing the digits and comparing with the original number.
Handle cases where multiple closest palindromic numbers exist by choosing the smaller one.
Round duration - 60 Minutes
Round difficulty - Medium
You are given two strings str1
and str2
. Determine the minimum number of operations required to transform str1
into str2
.
An operatio...
Determine the minimum number of operations needed to transform one string into another by moving characters to the end.
Iterate through each character in str1 and check if it matches the first character in str2. If it does, calculate the number of operations needed to move it to the end.
If no match is found for the first character in str2, return -1 as transformation is not possible.
Repeat the process for each test case...
Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each...
Find the minimum number of dice throws required to reach the last cell on a Snake and Ladder board.
Use Breadth First Search (BFS) to explore all possible paths with minimum dice throws.
Keep track of visited cells and the number of dice throws needed to reach each cell.
Consider the effect of snakes and ladders on the next position.
Return the minimum number of dice throws needed to reach the last cell.
If it is impossible
A web crawler is a program that systematically browses the internet to index and collect information from websites.
Start by identifying the target websites to crawl
Implement a queue to manage the URLs to be crawled
Use a crawler algorithm to visit and extract data from web pages
Implement a mechanism to handle duplicate URLs and avoid infinite loops
Consider implementing a robots.txt parser to respect website crawling rul
Round duration - 70 Minutes
Round difficulty - Medium
Design a system to handle millions of requests for key-value operations efficiently.
Use a distributed key-value store like Redis or Cassandra for storing data.
Implement sharding to distribute data across multiple nodes for scalability.
Use caching mechanisms like Memcached to reduce read latency.
Implement load balancing to evenly distribute incoming requests.
Use asynchronous processing for write operations to improve pe...
Tip 1 : Solve atleast 1 DS/Algo problem everyday
Tip 2 : Learn high level designs and low level designs
Tip 1 : Have your skills defined in bold like worked on scaling the system which takes 100 million traffic per day etc, have experience in BigData, kafka, AWS/Azure erc
Tip2 : Show your achievements separately like Won ABC Hackathon, ICPC Regional finalist, etc
I applied via Referral and was interviewed in Nov 2020. There was 1 interview round.
Get Excel column address based on number given.
Divide the number by 26 and get the remainder and quotient.
Convert the remainder to a character and add it to the result string.
Repeat until quotient is zero.
Find if a given string exists in a given matrix of characters
Iterate through each character in the matrix and check if it matches the first character of the given string. If it does, perform a depth-first search to check if the rest of the string can be formed from adjacent characters in the matrix.
Use a trie data structure to store all possible substrings of the matrix and check if the given string is present in the t...
Designing a video feed API
Define endpoints for accessing video feeds
Include authentication and authorization mechanisms
Consider scalability and performance
Support different video formats and resolutions
Provide error handling and logging
Ensure data privacy and security
I applied via LinkedIn and was interviewed in Feb 2022. There were 5 interview rounds.
Interview was around 1.15 hrs. Initially it was self introduction for both sides. Then a string manipulation related question was posted and asked to solve. At last it was queries to interviewer.
Total time 1hr. Self introduction for both parties.
Questions on CICD process in my project and automation ideas to handle errors with different scenarios. Then queries if any.
Total time 1.15hr.
Self introduction and coding question related to linked list in codility. The question was enhanced depending on splving techniques. Finally queries.
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Given a string ‘S’, your task is to rearrange its characters so that no two adjacent characters are the same. If it's possible, return any such arrangement, otherwise re...
Given a string, rearrange its characters so that no two adjacent characters are the same.
Iterate through the string and count the frequency of each character.
Use a priority queue to rearrange the characters based on their frequency.
Check if it's possible to rearrange the string without any two adjacent characters being the same.
Return 'Yes' if possible, 'No' otherwise.
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...
Find all nodes at distance K from a given node in a binary tree.
Perform a depth-first search starting from the target node to find nodes at distance K.
Use a recursive function to traverse the tree and keep track of the distance from the target node.
Maintain a set to store visited nodes to avoid revisiting them.
Return the list of nodes found at distance K from the target node.
Example: If the target node is 5 and K is 2 ...
Round duration - 60 Minutes
Round difficulty - Medium
Given N
events, each represented with a start
and end
time as intervals, i.e., booking on the half-open interval [start, end). Initially, the calendar is empty. A new event c...
Given N events with start and end times, determine if each event can be added to the calendar without causing a triple booking.
Iterate through each event and check if adding it causes a triple booking by comparing its interval with previous events
Use a data structure like a list or dictionary to keep track of booked intervals
Return 'True' if the event can be added without causing a triple booking, 'False' otherwise
Round duration - 45 minutes
Round difficulty - Easy
Tip 1 : Focus on fundamentals
Tip 2 : Focus on problem solving skills
Tip 3 : Be consistent
Tip 1 : Do not bloat your resume with non-sense, add only what you have done and only major projects.
Tip 2 : Be crisp - adding 10 programming languages in your resume won't take you anywhere but understanding 1 language with heart is definitely a major plus.
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
You are provided with a string STR
of length N
comprising lowercase English alphabet letters. Your task is to determine and return the minimum number of characters that n...
The task is to determine the minimum number of characters needed at the beginning of a string to make it a palindrome.
Iterate from both ends of the string and compare characters to find the number of characters needed to make it a palindrome.
Use dynamic programming to optimize the solution by storing results of subproblems.
Handle edge cases like an already palindrome string or an empty string.
Example: For 'deed', no ch...
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
Create a dynamic programming matrix to store intermediate results
Handle cases for '?' and '*' characters separately
Check if the characters in the pattern and text match accordingly
Return 'True' if the text matches the pattern, otherwise 'False'
Round duration - 90 minutes
Round difficulty - Medium
It was nice
BCNF stands for Boyce-Codd Normal Form, a higher level of normalization in database management systems.
BCNF is a stricter form of 3NF (Third Normal Form) and ensures that there are no non-trivial functional dependencies between attributes.
It helps in reducing redundancy and anomalies in the database.
BCNF is important as it helps in maintaining data integrity and improving database performance.
Example: If we have a tabl...
Tilt the container until the liquid reaches the edge, then pour out half of it.
Tilt the container slowly until the liquid reaches the edge
Once the liquid is at the edge, pour out half of it
This method works because the liquid will naturally settle at the lowest point, allowing you to estimate the halfway mark
Round duration - 45 mintues
Round difficulty - Easy
Very nice interviews very helpful.
Tip 1 : Mention the projects clearly, explaining the tech stack, the problem solved and whether its a group or individual project
Tip 2 : Do not put false things on resume.
Tip 3 : Mention only those skills, in which you are confident.
Tip 1 : Mention your important projects in detail.
Tip 2 : Try to make a single-page resume. Highlight skills, projects, and work experience more than CGPA. Ensure proper spacing and font to maintain professionalism.
Tip 3 : Keep it precise and concise.
Tip 4 : Mention your achievements related to the role you are applying for.
I appeared for an interview in Aug 2022.
Round duration - 60 minutes
Round difficulty - Medium
A problem solving round with 1 problem on DP. It was on a platform with a text editor provided. Was expected to solve the problem and write the code. Post initial discussion on the solution approaches came up with an optimized solution using Dynamic Programming and wrote the solution. Then some discussion on the Time and Space complexity of the solution.
Interviewer was satisfied with the solution and also dry ran with 1 test case.
Given a string S
composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...
Given a phone number string, generate all possible words by mapping digits to letters on a T9 keypad.
Create a mapping of digits to corresponding letters on a T9 keypad
Use recursion to generate all possible combinations of letters for the input phone number
Sort the generated strings in lexicographical order
Round duration - 60 minutes
Round difficulty - Hard
This round happened on the same day after 1st round. It was a Low level design round with one problem to be solved in 60 minutes.
Round duration - 60 minutes
Round difficulty - Medium
This round happened on the same day after 2nd round. The platform used was codility. It was a System design/ Low level design round with one problem to be solved in 60min.
Round duration - 30 minutes
Round difficulty - Easy
It was an HR round with focus on the work ethics, culture and my prior experiences. The recruiter was trying to test my situation handling capability by asking different scenario based questions.
Tip 1 : Practice problems with consistency
Tip 2 : Learn and try to up solve
Tip 3 : Enjoy each problem and try different ways of solving it
Tip 4 : Brush up OOP concepts
Tip 5 : Practice hands on for Low level design by white board coding
Tip 1 : Have 1-2 good quality projects.
Tip 2 : Try to maintain 1 page resume.
Tip 3 : Put things which you have in depth knowledge about in resume.
posted on 1 Jan 2025
I applied via Walk-in and was interviewed in Dec 2024. There were 2 interview rounds.
Inquiring about salary expectations will likely lead to an offer that does not exceed 30%, with 12% as a variable amount allocated for a performance bonus, which you may never receive, based on the rationale that your experience is not relevant, despite having a background in a related field such as voice processing. Additionally, do not anticipate clear job descriptions, as the company's approach is broad and diplomatic, reflecting a lack of transparency.
Experienced voice process executive with strong communication skills and a proven track record of delivering exceptional customer service.
Over 5 years of experience in handling customer queries and resolving issues efficiently
Proficient in using CRM software to track customer interactions and maintain records
Skilled in active listening and problem-solving to ensure customer satisfaction
Ability to work well under pressu
posted on 9 Jan 2025
I applied via Referral and was interviewed in Jul 2024. There were 2 interview rounds.
I am a dedicated and empathetic customer support associate with a passion for helping customers resolve their issues.
Experienced in handling customer inquiries and providing solutions
Strong communication skills both written and verbal
Ability to remain calm and professional in high-pressure situations
Familiar with CRM systems and ticketing platforms
Previous experience in retail customer service
I have a diverse background in customer service and communication skills.
Started as a customer service representative at XYZ Company, handling inquiries and resolving issues
Promoted to team lead, responsible for training new hires and managing escalations
Completed a communication skills workshop to improve interactions with customers
Experienced in customer service and problem-solving skills, with a background in retail and hospitality.
Started career in retail, providing excellent customer service and resolving issues
Transitioned to hospitality industry, honing communication and problem-solving skills
Currently seeking to apply skills in customer support role
posted on 17 Feb 2025
I appeared for an interview before Feb 2024.
English test, email writing
Digital Interaction Advisor
1.3k
salaries
| ₹1.2 L/yr - ₹4.2 L/yr |
Digital Interactive Specialist
989
salaries
| ₹1.2 L/yr - ₹5.5 L/yr |
Advisor
528
salaries
| ₹1.8 L/yr - ₹5 L/yr |
Digital Interaction Executive
376
salaries
| ₹1.1 L/yr - ₹5.5 L/yr |
Customer Service Executive
274
salaries
| ₹1.2 L/yr - ₹5 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
Microsoft Corporation