Trilogy Innovations Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 91 interview experiences · FREE TO READ
Which role are you interviewing for?
4 roles · 91 reportsCandidate interview experiences
First-hand accounts from people who interviewed at Trilogy Innovations.
Trilogy Innovations
Intern
Intern Average Neutral experience Decline offer 3 rounds
Interview process
Technical screen Recruiter call Technical screen
Interview formats
Coding Technical Behavioral
The interview process kicked off with an online assessment focusing on Data Structures & Algorithms questions, varying in difficulty from easy-medium to medium-hard. This was followed by two to four more interview rounds. These later rounds delved into core computer science subjects, included a discussion about your projects, and involved a thorough evaluation of your communication skills.
Confirmed questions4 questions
- Solve a DSA question
- Discuss core CS subjects
- Discuss your projects
Trilogy Innovations
Software Engineer Intern
Intern Difficult Positive experience No offer 4 rounds
Interview process
Technical screen Technical screen Technical screen Technical screen
Interview formats
Coding Technical Behavioral Technical
Just had my Trilogy interview. It had 4 rounds. First was an OA with 4 coding questions covering arrays, binary search, DP with matrix exponentiation, and segment trees. Then there was a round with 50 aptitude questions to be completed in 15 minutes. The third round was a resume deep dive focusing on my projects. Finally, there was a DSA round that was like a competitive programming question, and I didn't fully solve it. It was a great learning experience though! If you're interviewing, having strong DSA, quick aptitude skills, and clear project understanding are super important!
Confirmed questions7 questions
- Coding questions involving arrays
- Coding questions involving binary search
- Coding questions involving DP and matrix exponentiation
Trilogy Innovations
Backend Developer
Entry Difficult Neutral experience No offer 1 round
Interview process
Technical screen Take home
Interview formats
Coding
I applied through my college, and the first round was a coding test with 4 super hard questions. We were given a link to take the test, and it constantly monitored for cheating. Every time we tried to compile, our correctness score would decrease until it was accepted.
Confirmed questions1 question
- Coding problems involving multi-dimensional arrays
Trilogy Innovations
Software Intern
Intern Average Neutral experience No offer 4 rounds
Interview process
Phone screen Technical screen Technical screen Background check
Interview formats
Technical Coding Behavioral
The first round was a 30-minute phone call. Then there were two more interview rounds on Google Meet, each lasting about 45-50 minutes. Finally, there was an HR interview that went for around 40 minutes.
Confirmed questions3 questions
- Can you discuss your projects?
- What is the k-th smallest distance among all pairs in a given integer array? The distance between a pair (A, B) is the absolute difference between A and B.
- Find two nodes in a Binary Search Tree (BST) that sum up to a specific number A, using only O(h) space.
Trilogy Innovations Interview Questions
Quoted word for word from Trilogy Innovations interview reports.
“Given 'n' and 'g', find the number of ways to fill 'g' glasses so that the product of all numbers in the glasses equals 'n'. Return (ans % (10^9 + 7)).”
Read reports →“What is the k-th smallest distance among all pairs in a given integer array? The distance between a pair (A, B) is the absolute difference between A and B.”
Read reports →“What is the smallest missing value in the root of a binary tree?”
Read reports →“Given a tree with nodes numbered starting from 1, determine the mux of each subtree.”
Read reports →“How to find the shortest path with at most k edges?”
Read report →“What is the minimum number of swaps required to satisfy the condition arr[i]%3==i%3 for all elements in the array?”
Read report →“Consider a binary string made of 0s and 1s. Can you find the longest substring within it that has the same count of 0s and 1s?”
Read report →“Find the minimum element in all subarrays of length k, and then find the maximum among these minimums for a given array of numbers.”
Read report →“How would you build a prefix tree for fast string searching?”
Read report →Formats, difficulty and experience
Across all 91 Trilogy Innovations interview reports.