Tally Solutions Interview Experience for Software Engineer (On-Campus) 2022

The company visited our college in September 2022 for hiring.

Round-1: In this round, there were 3 DSA-based problems of easy-medium level. There were different sets of questions of all, mine was the following.

• Given array A and integer K, check whether the max element in the array is at least K times larger than all other elements or not. Ex. For A = {3, 1, 5, 9} and K = 2, gives false, because  9 < K * max{3, 1, 5}.
• Given an array, remove the minimum element and its adjacent elements in one step, and add this minimum element to the answer. Repeat this step until the array becomes empty. Return the sum of those minimum elements.  Ex. For A = {2, 1, 3, 4}, Answer = 1 + 4 = 5.
• Given matrix n x m with values [1e-9 to 1e9], you have to reach from (1, 1) to (n, m). We can move only one step towards the right or bottom. During the path traversal, we have to add the score written on that cell to our current score. The current score should not become zero at any point. For that, what minimum score should we have at the beginning?

Out of 90 students who appeared in this round, 23 students were shortlisted for the next round.

Round-2 (Technical round-1): (40 min)

• Tell me about yourself
• Reverse Linked-list in a block of size K (https://leetcode.com/problems/reverse-nodes-in-k-group/)
• Fibonacci series (recursive)
• What happens when we type URL in the browser
• Runtime polymorphism
• Tell me the case where you had to learn a new skill in a short time
• A little bit of discussion on projects
• Any questions?

Out of 23 students, 7 students were shortlisted for the next round.

Round-3 (Technical round-2 + HR): (50 min)

• Tell me about yourself
• Two puzzles
• Some mathematical questions. E.g. What is the last digit of 25¹⁰²
• How to convert a number from base-a to base-b.
• Array vs. Linked-list
• Greatest strength
• Two weaknesses, what are you doing to improve
• Any questions?

Tips: Get a solid grasp of the fundamentals. Memory allocations (malloc, calloc, heap memory, stack memory) were also discussed.

The interviewers were nice and friendly. They helped me when I got stuck and gave hints while I was not going in the right direction. It was a nice experience for me. 

Finally, 3 students (including me) got the job offer.