Trantor Private Limited interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Trantor Private Limited
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Easy
Group Discussion
Duration30 minutes
Interview date20 Aug 2021
Coding problem1
Group discussion conducted, they give one topic and give 2 min to prepare. You should speak with fluent English. They judge your communication and pronunciation.
1. GD Topic
Topic : Talk about the situation of the city after it rains.
Problem approach
I cleared the round.
02
Round
Easy
Video Call
Duration45 minutes
Interview date20 Aug 2021
Coding problem2
This was the second round. It was a technical round with questions based on DSA.
1. Check If The String Is A Palindrome
Easy
10m average time
90% success
0/40
Asked in companies
You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.
Note :
String 'S' is NOT case sensitive.
Example :
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Problem approach
A simple and intuitive approach could be to compare the given string with its reversed form and check whether they are equal or not. Ignoring the symbols, whitespaces and case during the comparison.
2. Armstrong number
Easy
15m average time
85% success
0/40
Asked in companies
You are given an integer ‘NUM’ . Your task is to find out whether this number is an Armstrong number or not.
A k-digit number ‘NUM’ is an Armstrong number if and only if the k-th power of each digit sums to ‘NUM’.
Example
153 = 1^3 + 5^3 + 3^3.
Therefore 153 is an Armstrong number.
Problem approach
The first step will be to find the length of the number.
Initialize an integer k = 0, it will be used to find the length of the number.
Initialise an integer sum = 0.
Run a while loop till num is not equal to 0 (to calculate the length of number):
Increment k by 1.
Run a while loop till num is not equal to 0:
The current digit will be num%10.
Add (current digit) ^ k into sum.
Make num = num/10.
Check if ‘sum’ is equal to the initial number.
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
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Trantor Private Limited
Rejected
703 views
0 comments
0 upvotes
Associate Software Engineer
2 rounds | 3 problems
Interviewed by Trantor Private Limited
Rejected
578 views
0 comments
0 upvotes
Machine learning engineer
2 rounds | 6 problems
Interviewed by Trantor Private Limited
Selected 494 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Trantor Private Limited
Selected 755 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
Selected 2370 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 2672 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
Selected 2347 views
0 comments
0 upvotes