Trilogy Innovations Interview Questions and Answers

Q1. Find cousine of a node in a binary tree
Ans. 
Find the cousin of a node in a binary tree.
• Cousins are nodes at the same level but with different parents.

• Traverse the tree to find the level and parent of the given node.

• Traverse the tree again to find all nodes at the same level with different parents.

• Return the cousin node if found, else return null.
Answered by AI
Add your answer
Q2. One question on 2 pointer appraoch
Ans. 
The two-pointer approach is an efficient technique for solving problems involving arrays or linked lists by using two indices.
• 1. The two-pointer technique involves using two pointers to traverse the data structure, often from opposite ends.

• 2. It is commonly used in problems like finding pairs in a sorted array that sum to a specific value.

• 3. Example: Given a sorted array [1, 2, 3, 4, 5] and a target sum of 6, use point...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Aptitude+Coding
Both the rounds were easy only student should have confidence in himself.
Coding Round 3 question-:
1.Array related
2.Level order traversal
3. Graph

Q1. 
Sum At Kth Level
Given the root of a binary tree, calculate the sum of all nodes located at the Kth level from the top. Consider the root node as level 1, and each level beneath it sequentially increases ...read more
Ans. 
Calculate the sum of nodes at the Kth level of a binary tree given the root.
• Traverse the binary tree level by level using BFS.

• Keep track of the current level while traversing.

• Sum the nodes at the Kth level and return the result.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

• Example: For arr...read more
Answered by AI
Add your answer
Q3. 
Number of Triangles in an Undirected Graph
Determine how many triangles exist in an undirected graph. A triangle is defined as a cyclic path of length three that begins and ends at the same vertex.
Input...read more
Ans. 
Count the number of triangles in an undirected graph.
• Iterate through all possible triplets of vertices to check for triangles.

• Use the adjacency matrix to determine if there is an edge between vertices.

• Count the number of triangles found in the graph and return the total count.
Answered by AI
Add your answer