Filter interviews by
Clear (1)
I applied via AmbitionBox and was interviewed in Dec 2024. There was 1 interview round.
posted on 28 Jun 2024
I applied via Naukri.com and was interviewed in May 2024. There were 3 interview rounds.
Assessment was done in online medium
I am a dedicated and detail-oriented individual with a strong background in customer service.
I have X years of experience in customer service roles
I am proficient in handling customer inquiries and resolving issues
I have strong communication and problem-solving skills
I am a team player and can work well under pressure
I am always looking to improve and learn new skills
My daily routine involves starting the day with exercise, followed by work, meals, and relaxation in the evening.
Wake up early and exercise for 30 minutes
Have breakfast and start work by checking emails and tasks
Take short breaks throughout the day for snacks and stretching
Have lunch and continue work until evening
Relax in the evening with a hobby or watching TV
Have dinner and prepare for the next day before bedtime
posted on 11 Mar 2022
I applied via Approached by Company
I applied via Company Website and was interviewed in Aug 2022. There were 8 interview rounds.
Based on subject knowledge
Based on topic we had to discuss
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering 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
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
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 Walk-in and was interviewed before Feb 2019. There were 5 interview rounds.
I applied via Campus Placement
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
I am excited to join your company because of its reputation for excellent customer service and commitment to employee development.
I have researched your company and am impressed by the positive reviews from customers and employees alike.
I am excited about the opportunity to work with a team that values collaboration and innovation.
I am confident that I can contribute to the company's success by utilizing my strong comm...
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Delivery Boy
869
salaries
| ₹0 L/yr - ₹0 L/yr |
Fleet Manager
580
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
519
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
497
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Store Manager
450
salaries
| ₹0 L/yr - ₹0 L/yr |
Zomato
Dunzo
FoodPanda
Rapido