Filter interviews by
Loops are programming constructs that allow for repeated execution of a block of code until a certain condition is met.
Loops are used to iterate over a collection of items or perform a set of instructions multiple times.
Common types of loops include for loops, while loops, and do-while loops.
Example: for(int i=0; i<5; i++) { // code block to be executed }
Top trending discussions
Rotate a matrix by 90 degrees clockwise
Transpose the matrix
Reverse each row of the transposed matrix
I'm navigating life's challenges with optimism, focusing on personal growth and professional development while maintaining a healthy work-life balance.
I recently completed a challenging project at work, which enhanced my skills in software development and teamwork.
I've been dedicating time to learning new programming languages, such as Python and JavaScript, to stay updated in the tech field.
In my personal life, I've s...
What is array, what is avl tree, what is b+ tree.
What is b+ tree, what is red black tree
What is avl tree, what is b+ tree
Build the conference room
OOP and DSA focused coding test.
I applied via Approached by Company and was interviewed in Apr 2024. There was 1 interview round.
Medium-Hard leetcode level question
posted on 12 Nov 2024
I applied via Approached by Company and was interviewed in May 2024. There was 1 interview round.
To make an array of strings unique, count the number of duplicate elements and increment them accordingly.
Iterate through the array and keep track of the frequency of each element.
For each duplicate element, increment it to make the array unique.
Return the total number of increment operations needed.
Sum all numbers formed from root to leaf paths in a binary tree
Traverse the tree from root to leaf nodes, keeping track of the current number formed
Add the current number to the sum when reaching a leaf node
Recursively explore left and right subtrees
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
Machine coding round for an App engineer role.
Please have personal laptop setup properly
One common algorithm with graphs is Dijkstra's algorithm for finding the shortest path.
Dijkstra's algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.
It works by maintaining a priority queue of nodes based on their distance from the starting node.
The algorithm iteratively selects the node with the smallest distance, updates the distances of its neighbors, and repeats ...
based on 1 interview experience
Consultant
105
salaries
| ₹20 L/yr - ₹35 L/yr |
Senior Consultant
31
salaries
| ₹29 L/yr - ₹44.8 L/yr |
Associate Consultant
30
salaries
| ₹10.4 L/yr - ₹18.8 L/yr |
Support Engineer
22
salaries
| ₹14.7 L/yr - ₹25.3 L/yr |
Technical Consultant
13
salaries
| ₹18.7 L/yr - ₹32 L/yr |
iEnergizer
Bharti Airtel
WNS
Tata Motors