Filter interviews by
I applied via Walk-in and was interviewed before Jul 2020. There were 4 interview rounds.
Yes, I have experience in making cutting lists for modular furniture.
I am familiar with the different types of modular furniture and their components
I can read and interpret design plans and specifications
I have knowledge of cutting tools and techniques
I am able to accurately measure and calculate material requirements
I have experience using software programs such as SketchUp and CutList Plus
Yes, I have experience operating Panel saw, multi boring, and edge banding machines.
I have operated Panel saw machines to cut large sheets of wood into smaller pieces.
I have used multi boring machines to drill holes in wood for dowels and screws.
I have experience with edge banding machines to apply a thin strip of material to the edge of a piece of wood.
I am familiar with the safety protocols and maintenance required f
Yes, I have experience in fitting and carpentry work.
I have worked on various production projects that required fitting and carpentry work.
I am skilled in using various tools and equipment for carpentry work.
I have experience in measuring and cutting materials to precise specifications.
I am familiar with different types of wood and their properties.
I have knowledge of safety procedures and regulations related to carpen
Yes, I have knowledge of modular kitchen designing and estimation and costing.
I have experience in designing modular kitchens using software like AutoCAD and SketchUp.
I am familiar with the materials and hardware used in modular kitchen construction.
I have worked on estimating and costing projects for modular kitchens, taking into account factors like materials, labor, and overhead costs.
I have also collaborated with s...
I did my internship at XYZ Corporation.
Interned at XYZ Corporation
Worked in the marketing department
Assisted in creating social media campaigns
Conducted market research
Attended meetings with clients
I learned to take responsibility for my actions and to use my mistakes as opportunities for growth.
I learned to admit my mistakes and apologize when necessary
I learned to reflect on my mistakes and identify areas for improvement
I learned to seek feedback from others and use it to make positive changes
I learned to not be afraid of failure and to view it as a learning experience
For example, when I made a mistake at work ...
I have the skills, experience, and passion to contribute to the success of your company.
I have a proven track record of achieving targets and exceeding expectations.
I possess strong communication and interpersonal skills, which enable me to work effectively with colleagues and clients.
I am a quick learner and adaptable to new environments and technologies.
I am passionate about the industry and eager to contribute to th...
I am not currently planning on getting married.
I am currently focused on my career and personal growth.
Marriage is not a priority for me at this time.
I believe in taking the time to find the right person and building a strong foundation before getting married.
I am a software engineer with experience in developing and maintaining software applications.
I have a strong background in programming languages such as Java, C++, and Python.
I have worked on various projects, including developing web applications and implementing software solutions.
I am skilled in problem-solving and debugging, ensuring efficient and effective software development.
I have experience in collaborating wi...
I learned valuable teamwork and problem-solving skills during my summer internship.
Developed strong collaboration skills by working with a team of software engineers to complete projects
Gained experience in troubleshooting and debugging software issues
Learned to effectively communicate and present technical concepts to both technical and non-technical stakeholders
Improved problem-solving abilities by identifying and re...
Find sum of all numbers formed from root to leaf path in a binary tree
Traverse the binary tree using DFS
At each leaf node, add the number formed from root to leaf path to a sum variable
Return the sum variable
Time complexity: O(n)
Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25
Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.
Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string
Preorder traversal without recursion
Use a stack to keep track of nodes
Push right child first and then left child onto stack
Pop top of stack and print value
Repeat until stack is empty
Find longest continuous patch on a 12 km road with updates in patches
Maintain a variable to keep track of current patch length
Update the variable whenever a new patch is added
Maintain a variable to keep track of longest patch so far
Compare current patch length with longest patch length and update if necessary
Use a sorted data structure like a binary search tree to store the patches for efficient search
Time complexity: ...
Find median of an unsorted array.
Sort the array and find the middle element
Use quickselect algorithm to find the median in O(n) time
If the array is small, use brute force to find the median
Find 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of closest elements.
Update the queue as new characters come in.
Return the 'k' closest elements from the queue.
Design a data structure with O(1) insert, remove, find-max, and delete-max operations.
Use a doubly linked list to maintain the elements in sorted order.
Use a hash table to store the pointers to the nodes in the linked list.
Maintain a pointer to the maximum element in the hash table.
Update the pointers in the hash table when inserting or removing elements.
Update the maximum pointer when deleting or inserting the maximum
Check if a given linked list is a palindrome.
Traverse the linked list and store the values in an array.
Compare the first and last elements of the array, then move towards the center.
If all elements match, the linked list is a palindrome.
Alternatively, use two pointers to find the middle of the linked list and reverse the second half.
Compare the first half with the reversed second half to check for a palindrome.
based on 5 reviews
Rating in categories
TCS
Accenture
Wipro
Cognizant