Filter interviews by
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
Code to find two numbers in an array that add up to a target sum
Use a hashmap to store the difference between the target sum and each element
Iterate through the array and check if the current element's complement exists in the hashmap
Return the indices of the two numbers that add up to the target sum
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Jun 2021. There were 3 interview rounds.
Decision Tree is preferred over Random Forest when interpretability is important.
Decision Tree is easier to interpret and visualize than Random Forest.
Decision Tree is better suited for small datasets with few features.
Random Forest is better suited for large datasets with many features.
Random Forest is less prone to overfitting than Decision Tree.
Decision Tree can be used as a building block for Random Forest.
If inter...
I applied via LinkedIn and was interviewed before Oct 2022. There were 4 interview rounds.
Coding covered LC medium and easy questions on recursion, trees n dp.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
Flip-flops and latches are sequential logic circuits used to store and manipulate binary data.
Flip-flops are edge-triggered devices, while latches are level-sensitive devices.
Flip-flops have separate clock and data inputs, while latches have a single input for both clock and data.
Flip-flops are used in synchronous circuits, while latches are used in asynchronous circuits.
Flip-flops are more complex and require more cir...
I applied via TCS NQT and was interviewed in Jun 2021. There was 1 interview round.
posted on 17 Jun 2024
I applied via Naukri.com and was interviewed in Dec 2023. There were 3 interview rounds.
posted on 21 Jun 2024
I applied via Recruitment Consulltant
Find the minimum element in an array of strings
Iterate through the array and compare each element to find the minimum
Use built-in functions like Math.min() or sort() to find the minimum
Handle edge cases like empty array or array with only one element
Reverse a linked list by changing the next pointers of each node
Iterate through the linked list and change the next pointers to reverse the list
Use three pointers - prev, current, and next to keep track of nodes
Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
posted on 26 Aug 2024
I appeared for an interview before Aug 2023.
based on 1 interview
Interview experience
Software Engineer
127
salaries
| ₹3.2 L/yr - ₹12 L/yr |
Software Developer
63
salaries
| ₹2.4 L/yr - ₹9 L/yr |
Business Analyst
39
salaries
| ₹3 L/yr - ₹11.3 L/yr |
Senior Software Engineer
20
salaries
| ₹4.7 L/yr - ₹18 L/yr |
Quality Analyst
18
salaries
| ₹2.7 L/yr - ₹6.6 L/yr |
Fractal Analytics
MathCo
Innovatiview India Ltd
Watchyourhealth.com