Tally Solutions

Role: Software Engineer

College: Not Specified

Interview Date: September 2022

Interview Type: On-Campus

Result: Selected

Difficulty: Easy-Medium

Rounds: 3 rounds

Topics Asked: Data Structures, Algorithms, Operating Systems (Web concepts), OOPs (Runtime Polymorphism), Puzzles, Mathematical Questions, HR, Memory Management

Experience:

Tally Solutions visited the college in September 2022 for a recruitment drive.

Round 1 (Online Coding): This round had 3 DSA-based problems of easy-medium difficulty, with different sets for candidates. Examples of questions included:

• 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.
• 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.
• Given matrix n x m with values [1e-9 to 1e9], reach from (1, 1) to (n, m). Can move only right or bottom. Add cell score to current score. Current score should not become zero. What minimum score should be had at the beginning?

Out of 90 students, 23 were shortlisted.

Round 2 (Technical Round 1): This round lasted 40 minutes. Questions included:

• Tell me about yourself.
• Reverse Linked-list in a block of size K.
• 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 were shortlisted.

Round 3 (Technical Round 2 + HR): This round lasted 50 minutes. Questions included:

• Tell me about yourself.
• Two puzzles.
• Some mathematical questions (e.g., What is the last digit of 25^102).
• 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 included getting a solid grasp of fundamentals, especially memory allocations (malloc, calloc, heap, stack memory). The interviewers were helpful and provided hints. Finally, 3 students, including the candidate, received job offers.