Trilogy Innovations Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 79 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Trilogy Innovations.
Trilogy Innovations
Software Engineer
Mid Difficult Positive experience Decline offer 1 round
Interview process
Technical screen Onsite
Interview formats
Coding
Typically, there are 4 problems to solve in 120 minutes. Coding platforms might be live and proctored, so expect slow responses or delays when submitting. Common question types include Arrays, 2D arrays, matrix manipulation, subarray operations, and scheduling algorithms, as well as Dynamic Programming (DP) with 2D DP, greedy algorithms, and array-based hard DP questions.
Confirmed questions3 questions
- What's the minimum number of swaps needed to sort an array?
- Can you solve the problem involving swapping adjacent elements only if their product is a perfect square?
- How do you find the maximum rectangular area consisting entirely of 1s within a binary matrix?
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
Software Development Engineer
Mid Difficult Negative experience No offer 7 rounds
Interview process
Technical screen Technical screen Technical screen Technical screen Technical screen Technical screen Technical screen
Interview formats
Coding Technical
It was a 7 round process. The first round was a coding round where I had to solve 4 coding questions. Two of them were based on arrays and were easy, and the other two were also based on arrays but were difficult. After that, there were 5 more rounds which were all technical interviews. Yes, 5 technical rounds! In each of these rounds, they were testing different unique skills and my logic building abilities.
Confirmed questions1 question
- I was asked a question related to trees and graphs.
Trilogy Innovations Software Engineer 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 →“Given a tree with nodes numbered starting from 1, determine the mux of each subtree.”
Read reports →“What is the minimum number of swaps required to satisfy the condition arr[i]%3==i%3 for all elements in the array?”
Read reports →“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 reports →“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 →“Given two arrays A and B, and a third array C formed by the Bitwise OR of all pairs of elements from A and B, find the Bitwise XOR of array C.”
Read report →“What is the missing number in an array containing numbers from 1 to n?”
Read report →“Given an array, you can remove an element from either the start or the end. The remaining elements in the array are then doubled. If you perform K operations, what is the maximum sum you can achieve?”
Read report →“How many permutations of an array of length A with elements from 1 to C exist where no subarray of length greater than B has duplicates?”
Read report →Formats, difficulty and experience
Across all 79 Trilogy Innovations interview reports.