Filter interviews by
I worked on a successful project management software that increased team productivity by 20%.
Led cross-functional team to develop user-friendly interface
Implemented agile methodology to streamline development process
Conducted user testing and feedback sessions to iterate on features
I was interviewed in Apr 2017.
I was interviewed before Aug 2016.
The BCG matrix is a strategic planning tool used to analyze a company's portfolio of products or business units.
Developed by the Boston Consulting Group (BCG)
It categorizes products/business units into four quadrants based on market growth rate and market share
Quadrants: Stars, Cash Cows, Question Marks, and Dogs
Helps in resource allocation and strategic decision-making
Example: Apple's iPhone as a Star, iPod as a Cash ...
Market segmentation is the process of dividing a broad target market into smaller, more specific groups based on common characteristics.
Market segmentation helps businesses identify and target specific customer groups.
It involves analyzing factors such as demographics, psychographics, and behavior to create segments.
Segments can be based on age, gender, income, interests, location, etc.
By understanding the needs and pr...
My strengths include strong communication skills, adaptability, and problem-solving abilities.
Strong communication skills: I am able to effectively convey information and ideas to others.
Adaptability: I am able to quickly adjust to new situations and environments.
Problem-solving abilities: I am skilled at analyzing complex problems and finding creative solutions.
One of my weaknesses is that I tend to be overly critical of my own work.
I have a tendency to be a perfectionist and spend too much time on tasks
I struggle with delegating tasks to others
I can be overly self-critical and have difficulty accepting praise or recognition
I am a dedicated and passionate individual with a strong work ethic and a proven track record of success.
I have consistently achieved top grades in my academic studies, showcasing my commitment to excellence.
I have completed multiple internships in the past where I received glowing feedback from supervisors for my hard work and dedication.
I am actively involved in extracurricular activities such as volunteering and lea...
I was interviewed before Jul 2016.
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.
The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.
Traverse the n-ary tree using a depth-first search (DFS) algorithm
Keep track of the count of 'B' occurrences
When the count reaches 3, return the current position
If the end of the tree is reached before the 3rd 'B', return -1
Check if a given string is a composite of two words from a limited dictionary.
Create a hash set of all the words in the dictionary.
Iterate through all possible pairs of substrings in the given string.
Check if both substrings are present in the hash set.
If yes, return true. Else, return false.
Switch adjacent nodes in a single linked list.
Traverse the linked list and swap adjacent nodes.
Keep track of previous node to update its next pointer.
Handle edge cases for first two nodes and last node.
Example: 1->2->3->4 becomes 2->1->4->3.
Traverse only the left sub-tree of a binary search tree.
Start at the root node
If the left child exists, visit it and repeat the process
If the left child does not exist, return to the parent node
Continue until all nodes in the left sub-tree have been visited
Design an efficient data structure for two lifts in a building of n floors.
Use a priority queue to keep track of the floors each lift is heading to
Implement a scheduling algorithm to determine which lift to assign to a new request
Consider adding a weight limit to each lift to prevent overloading
Use a hash table to keep track of the current location of each lift
To find the maximum number that can be formed from the digits of an integer.
Convert the integer to a string
Sort the characters in descending order
Join the sorted characters to form the maximum number
based on 2 interviews
Interview experience
Production Supervisor
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Company Secretary
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Junior Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Mechanical Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Flipkart
Reliance Industries
Tata Group