Tennr interview experience Real time questions & tips from candidates to crack your interview

Implementation Engineer

Tennr
upvote
share-icon
4 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I am a B.Tech undergraduate from a tier-2 college, passionate about computer science from day one. I am currently working as an SDE-1 and am looking to join a startup where I can learn and grow further.
Application story
I received a direct referral by sending my resume to an employee through a connection. He shared my resume with HR, and I then received a call from HR asking if I was interested in the role. After confirming my interest, I was given an assignment. One day later, I received an email stating that I was ready for the next round. After the online assignment, there were three more rounds in the interview process.
Why selected/rejected for the role?
I got rejected in the final managerial round because, according to the interviewer, I was less aligned with the implementation engineer role.
Preparation
Duration: 3 months
Topics: OOPS, DBMS, DSA, High Level Design, Communication
Tip
Tip

Tip 1: Practice coding problems online.
Tip 2: Don’t just solve problems—try to understand alternative approaches for each problem.
Tip 3: Have a strong understanding of your resume.

Application process
Where: Referral
Eligibility: NA, (Salary package: 14 LPA)
Resume Tip
Resume tip

Tip 1: Keep at least two projects.
Tip 2: Understand your projects in a practical way.

Interview rounds

01
Round
Medium
Assignment
Duration2 days
Interview date24 Sep 2025
Coding problem1

1. System Design

Create a flow diagram and design hospital management system.

02
Round
Medium
Video Call
Duration45 minutes
Interview date8 Oct 2025
Coding problem2

The interview was completely DSA-focused, with one DSA question and multiple follow-up questions discussed continuously for 45 minutes.

1. Group Anagrams

Moderate
30m average time
70% success
0/80
Asked in companies
AmazonAtlassianThales

You have been given an array/list of strings 'inputStr'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one another.

An anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.

Note:
The order in which the groups and members of the groups are printed does not matter.
For example:
inputStr = {"eat","tea","tan","ate","nat","bat"}
Here {“tea”, “ate”,” eat”} and {“nat”, “tan”} are grouped as anagrams. Since there is no such string in “inputStr” which can be an anagram of “bat”, thus, “bat” will be the only member in its group.
Problem approach

Use a hash map where the key is the sorted string (or character frequency signature) and group all strings sharing the same key.

Try solving now

2. Time Complexity

I was asked to determine the time and space complexity of the above HashMap question.

Solution: I used extra space of 26 to solve it.

Problem approach

Tip 1: Along with solving coding problems, prepare for follow-up questions.
Tip 2: Try to arrive at the most optimized approach by the end of your solution.

03
Round
Medium
Video Call
Duration45 minutes
Interview date14 Oct 2025
Coding problem2

The interview round focused on three key areas: Data Structures and Algorithms (DSA), resume discussion, and high-level system design.

1. System Design

Design a rate-limiting system using high-level design and explain each step along with possible follow-up questions.

Problem approach

Tip 1: Review your resume thoroughly.
Tip 2: Learn the basics of system design.
Tip 3: Understand DBMS concepts and the reasons behind scalability.

2. Koko Eating Bananas

Moderate
25m average time
70% success
0/80
Asked in companies
AtlassianTennrUnthinkable Solutions LLP

A monkey is given ‘n’ piles of bananas, where the 'ith' pile has ‘a[i]’ bananas. An integer ‘h’ is also given, which denotes the time (in hours) in which all the bananas should be eaten.


Each hour, the monkey chooses a non-empty pile of bananas and eats ‘m’ bananas. If the pile contains less than ‘m’ bananas, then the monkey consumes all the bananas and won’t eat any more bananas in that hour.


Find the minimum number of bananas ‘m’ to eat per hour so that the monkey can eat all the bananas within ‘h’ hours.


Example:

Input: ‘n’ = 4, ‘a’ =  [3, 6, 2, 8] , ‘h’ = 7

Output: 3

Explanation: If ‘m’ = 3, then 
The time taken to empty the 1st pile is 1 hour.
The time taken to empty the 2nd pile is 2 hour.
The time taken to empty the 3rd pile is 1 hour.
The time taken to empty the 4th pile is 3 hour.
Therefore a total of 7 hours is taken. It can be shown that if the rate of eating bananas is reduced, they can’t be eaten in 7 hours.
Problem approach

Applied binary search on K (speed) and use a helper function to check whether Koko can finish all piles within H hours.

Try solving now
04
Round
Easy
HR Round
Duration30 minutes
Interview date22 Oct 2025
Coding problem1

1. HR Questions

  • Introduce yourself.
  • Why do you want to join this role?
  • What are your salary expectations?
  • Where do you see yourself in the next 5 years?
Problem approach

Tip 1: Communicate clearly and confidently.
Tip 2: Have clarity about your resume.
Tip 3: Be clear about why you want this role.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3319 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes