Filter interviews by
Top trending discussions
I will handle the team by setting clear expectations, delegating tasks effectively, monitoring progress, and providing support as needed.
Set clear goals and deadlines for the team to ensure everyone is on the same page
Delegate tasks based on team members' strengths and workload
Regularly check in with team members to monitor progress and offer assistance if needed
Adjust deadlines or redistribute tasks as necessary to me...
I applied via Naukri.com and was interviewed in Nov 2024. There were 3 interview rounds.
Coding round is related to DSA
I applied via Approached by Company and was interviewed in Jul 2024. There were 5 interview rounds.
Asked some basic level questions
Asked little bit hard questions
Asked depth questions and wrote some sample programs
I applied via Referral and was interviewed in Dec 2023. There was 1 interview round.
I was interviewed in Mar 2022.
Round duration - 60 minutes
Round difficulty - Medium
Mcq + Data structures questions
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
137
O(1) because the extra space being used (looping vari...
Round duration - 70 minutes
Round difficulty - Medium
Standard System Design round
Tip 1 : Implement using OOPs
Tip 2 : Try to tell your approach to the interviewer as much as you can side by side
Round duration - 90 minutes
Round difficulty - Medium
Interview of DSA + OOPS + Databse(SQL query) + Operating System
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:O(N), where ‘N’...
Round duration - 60 minutes
Round difficulty - Easy
Hr round - normal hr questions + situational
Thoughtworks community discussion
Tip 1 : Read all Thoughtworks community page and be honest
Tip 2 : Be open-minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.
Tip 3 : The cross-questioning can go intense sometimes, think before you speak.
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 was interviewed in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
The task is to determine if a given singly linked list forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the list.
To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.
The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer ...
Round duration - 60 minutes
Round difficulty - Medium
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree
During the BFS traversal, keep track of the current level and increment the depth by 1 for each level
Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
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 is to find the intersection of two sorted arrays.
Use two pointers to iterate through the arrays.
Compare the elements at the current pointers and move the pointers accordingly.
If the elements are equal, add it to the intersection array and move both pointers.
If the element in the first array is smaller, move the first pointer.
If the element in the second array is smaller, move the second pointer.
Repeat until...
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.
Mutex has ownership, meaning the thread that locks it must unlock it.
Semaphore does not hav...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 25 minutes
Round difficulty - Easy
Tip 1 : Practice a lot of DSA questions on various online platforms.
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.
Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.
based on 1 interview
Interview experience
Software Engineer
48
salaries
| ₹2.8 L/yr - ₹8.2 L/yr |
Senior Software Engineer
34
salaries
| ₹6.7 L/yr - ₹27 L/yr |
Lead Engineer
29
salaries
| ₹9.2 L/yr - ₹21 L/yr |
Software Developer
20
salaries
| ₹4.5 L/yr - ₹15 L/yr |
Technical Lead
18
salaries
| ₹15.8 L/yr - ₹36 L/yr |
TCS
Infosys
Wipro
HCLTech