'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Cleartrail Technologies interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Cleartrail Technologies
1 rounds | 3 Coding problems
Interview preparation journey
Preparation
Duration: 1.5 Months
Topics: Data Structures and Algorithms, Operating System, Computer Networks, Security, and Authentication.
Tip

Always be confident in front of the interviewer but don’t be overconfident. Also for interview preparation, I took course from CodingNinjas which was a game-changer for me as I got to know all the important concepts and questions which are asked in interviews.

Application process
Where: Campus
Eligibility: 6.5 CGPA
Resume tip

Be honest on resume. Keep it subtle. Even if you are a good Competitive programmer, don’t brag during interviews.

Interview rounds
01
Round
Easy
Face to Face
Duration25 minutes
Interview date2 Feb 2019
Coding problem3

This was face to face interview round. All questions asked by the interviewer were based on data structures.

1. Detect loop
Moderate
15m average time
80% success
0/80

Detect loop in linked list.

Problem approach
• I told the interviewer about two pointers approach that is using the concept of the slow and fast pointer. Then he asked me to write its code which I wrote very neatly with comments in the code.
2. Tree Symmetricity
Easy
20m average time
82% success
0/40

Given a binary tree, check whether it is a mirror of itself.

For example, this binary tree is symmetric:

1

/      \

2        2

/    \     /   \

3    4  4     3

But the following is not:

<...
View more
Problem approach
• I just give recursion based approach to the interviewer by checking the current root and calling the recursion on the left and right part. Also after the discussion of approach I wrote its functional code to the interviewer.
3. Anagram Pairs
Moderate
30m average time
60% success
0/80

Check whether two given strings are anagram or not.

Problem approach
• I firstly gave sorting and comparing solution, but he asked me to optimize it so I gave him a hashing based solution and he was satisfied by my approach.
Start a Discussion
Similar interview experiences
Product Intern
6 rounds | 9 problems
0 views
4 rounds | 5 problems
1035 views
SDE - 1
3 rounds | 10 problems
Interviewed by Sterlite Technologies Limited
753 views
Product Engineer
3 rounds | 5 problems
391 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
92627 views