Etranzact international interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Etranzact international
3 rounds | 6 Coding
problems
Selected Interview preparation journey
Journey
So, I applied to this company via referal (he was my senior). I received a call a week later that I have been shortlisted for interview rounds. As I knew TranZact mainly focuses on DSA skills and I started preparing for that. Also, I asked the recruiter what things are expected to be asked, she told DSA and LLD basics.
Application story
TranZact did not visit my campus. I approached one of the Senior working there as a SDE-2 for the position of SDE Intern. He then approached HR for my application, within a week I got the call from the HR for the same. I was given a week time buffer before my interview scheduled date.
Why selected/rejected for the role?
After reading this, the first thing that occurs to me is how sure I was in my responses. Even though my solution to the issue was not very clear, I felt confident in my knowledge. Later, the interviewer showed me where to go. I also didn't rush to respond when a difficult question was posed. I maintained my composure and gave myself time to plan my strategy and speak.
Preparation
Duration: 4 months
Topics: Data Structures, OOPS, System Design, Dynamic Programming, Low Level Designing, Binary Search, Trees, Graphs
Tip 1 : Give mock interview atleast once if you are giving for the first time directly.
Tip 2 : Solve Strivers DSA sheet.
Tip 3 : Have a good grip on Core Fundamentals i.e OS, CN, OOPs, DBMS
Application process
Where: Referral
Eligibility: NA
Tip 1:Be as clear as possible.
Tip 2:Be specific of the tasks you did in internships or personal projects
Tip 3:Don't add technology which you don't know in resume
Tip 4:Don't add unnceccesary things like hobby, school grades, etc
Interview rounds
01
Round
Medium
Video Call
Duration50 minutes
Interview date4 Jul 2022
Coding problem1
The round was conducted on Google Meet. The interview of scheduled in afternoon at 2 PM. I was asked to introduce myself in terms of my technical skills and the technologies that I have used to date. And then he asked me in which language I was comfortable with the most. Told him that I was comfortable in C++ for DSA and JavaScript for Development.
He then shared one Google Docs link with me and then he verbally asked me one DSA question and then he pasted the question in the docs.
1. House Robber III
Moderate
35m average time
65% success
0/80
Asked in companies
The ninja visits an amusement park but finds himself confused because he wants to ride the rides such that he gets maximum fun. The amusement park has only one entrance that is root.
Each ride has a fun number assigned to it and ninja wants to maximize this fun but there is a rule in the park that no one is allowed to ride two directly connected rides.
As the ninja is smart and good in programming because he did a course from coding ninja, he found immediately that park rides are connected like binary tree where the root is the root of the binary tree. Help the ninja to get the maximum fun this time.
Problem approach
This is a very famous Tree problem, I knew about this problem but not very sure of the approach. I then also clarified the question and drew the tree and told him the expected outpout so that I am on the right path. So then I tried to explain the approach for the problem.
We know that we cant choose consecutive nodes in a tree thus this leaves us with 2 options when we reach a node -
1)Include that node and then include its grandchildren, in this way we don't select any connected nodes.
2)Dont include the node and return the sum of maximum values of its children that are the left and right subtrees
I then wrote a purely recursive solution for this, and also run the code.. But it gave me TLE which was obvious. He then asked me to optimize it, which I did after memoizing the solution.
For Memoization I used Unordered Map.
02
Round
Medium
Video Call
Duration50 minutes
Interview date5 Jul 2022
Coding problem4
Second Technical round was scheduled on the other day in the afternoon from 5PM-6PM.
This round was too purely based on DSA. Started with an introduction and asked me about the projects I worked on and Tech I used in them.
Interviewer was very helpful and coooperative.
1. Merge Intervals
Moderate
20m average time
80% success
0/80
Asked in companies
You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.
The task is to merge all the overlapping intervals and return the list of merged intervals sorted by increasing order of their start time.
Two intervals [A,B] and [C,D] are said to be overlapping with each other if there is at least one integer that is covered by both of them.
For example:
For the given 5 intervals - [1, 4], [3, 5], [6, 8], [10, 12], [8, 9].
Since intervals [1, 4] and [3, 5] overlap with each other, we will merge them into a single interval as [1, 5].
Similarly, [6, 8] and [8, 9] overlap, merge them into [6,9].
Interval [10, 12] does not overlap with any interval.
Final List after merging overlapping intervals: [1, 5], [6, 9], [10, 12].
Problem approach
To solve this problem,I started by sorting the intervals by their starting point. This will allow us to easily find the right interval for each interval.
Then,I iterate through the sorted intervals and for each interval i, we can perform a binary search on the remaining intervals to find the right interval for i. If we find an interval j with startj >= endi, then j is the right interval for i. Otherwise, if we don't find any such interval, then the right interval for i is -1.
I also wrote a code for that.. had some mistakes while implementing, which the interviewer helped to remove them..
Overall this was a good Question.. I took time more then required for this question. He was to ask me another DSA problem but because of time constraints he didn't.
2. OS Questions
After the DSA problem, he asked me some questions from OS and CN. Questions were as follow :
1) What is Mutex ?
2) What is Semaphores ?
3) Difference between semaphore and mutex ?
So, these were the core fundamentals questions asked..
Problem approach
Tip 1: First think in your mind what you are doing to speak, and then only start speaking.. No issue in asking for time and build an abstract solution in your mind first.
Tip 2: Explain step by step even if you are getting in much detail.. But the person in front of you must understand what you are trying to tell.
Tip 3: Have a good understanding of core subjects, atleast the top interview questions which are asked in every interview rounds.
3. Networking Question
What is Gateway and Router ? and the difference between them
4. OS question
What is Paging ?
03
Round
Easy
HR Round
Duration20 mins
Interview date5 Jul 2022
Coding problem1
This round was a casual round, nothing much happened in this round. .. He then told me the culture of TranZact.. As it is in a startup phase, they will be a workload some days.
This was it.
I was sure of getting an offer from TranZact..
1. Basic HR Questions
Introduce yourself.
Why this company?
I was asked about the technology I worked or willing to work on
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
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
960 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15480 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15338 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10142 views
2 comments
0 upvotes