Filter interviews by
I applied via Campus Placement and was interviewed in Mar 2023. There were 3 interview rounds.
4 coding questions which were very difficult which even a expert with 10 years industry experience would not crack it
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Deep data structure is required. Most of the questions are based on graphs and trees. Linked list stack and priority queue is helpful.
Codding round is tough.
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
40 MINS,DSA AND OFFLINE PLATFORM
I was interviewed in Dec 2021.
Round duration - 60 minutes
Round difficulty - Easy
You are provided with an array/list 'prices', where each element signifies the prices of a stock as of yesterday and the indices represent minutes. The task is to d...
Given stock prices, find the maximum profit from a single buy and sell action.
Iterate through the array and keep track of the minimum price seen so far and the maximum profit achievable.
Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.
Return the maximum profit obtained after iterating through the array.
Example: For prices = [2, 100, 150, 120], buy at 2
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Work hard
Tip 2 : Prepare resume well
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Trilogy Innovations interview questions for popular designations
I applied via Campus Placement and was interviewed in Jun 2022. There were 2 interview rounds.
It needed hard core DSA
I could not qualify for 2nd round
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Two DSA problems of difficulty rating of 1500-1800 on Codeforces.
Given a sorted array 'A' of length 'N', and two integers 'K' and 'X', your task is to find 'K' integers from the array closest to 'X'. If two integers are at the same distance, pre...
Find K closest elements to X in a sorted array A.
Use binary search to find the closest element to X in the array.
Maintain two pointers to expand around the closest element to find K closest elements.
Handle cases where two elements are equidistant by choosing the smaller one.
Return the K closest elements in a new array.
Mr. Schrodinger needs to generate points that are uniformly distributed inside a specific circle for testing his hypothesis. Your task is to implement a function that ge...
Implement a function to generate random points uniformly distributed inside a circle.
Generate random points using polar coordinates
Ensure points fall within the circle by checking if distance from center is less than or equal to radius
Check if points are uniformly distributed by running statistical tests
Return 1 if points are uniformly distributed, else return 0
Round duration - 45 minutes
Round difficulty - Medium
This round was majorly based on my resume discussion. It was with a senior VP. We had an in-depth discussion on my past interview experiences, my projects etc.
Tip 1 : Give regular programming contests. Try to achieve Codeforce Candidate Master level or equivalent
Tip 2 : Learn/Practice DSA.
Tip 3 : Do at least 2 projects on your resume, on topics such as ML, NLP, Dev etc
Tip 1 : Mention atleast 2 good projects and be thorough with them.
Tip 2 : Mention CP contest rankings or ratings
I applied via Naukri.com and was interviewed in Feb 2022. There were 2 interview rounds.
2hr coding round test and questions were based on DSA
1 hr Aptitude test which was average base but I got rejected after that.
Top trending discussions
I was interviewed before Sep 2016.
posted on 9 Nov 2021
I was interviewed in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
You are provided with an array or list of integers named ARR
of size N
. The task is to determine two things:
Count the number of elements with odd and even occurrences in an array of integers.
Iterate through the array and use a hashmap to store the count of each element.
After counting, iterate through the hashmap to determine odd and even occurrences.
Return the counts of elements with odd and even occurrences.
You are given a singly linked list where each node contains an integer value and a reference to the next node or NULL if it is the last node. The task is to remov...
Remove nodes in a singly linked list with a greater value on the right.
Traverse the linked list and compare each node's value with the values of nodes to its right.
If a node has a greater value on the right, remove it from the linked list.
Update the references of the previous node to skip the removed node.
Tip 1 : Try solving Love Babbar 450 Prog questions
Tip 2 : Have a good resume
Tip 3 : Do learn some extra technologies eg. ML/AI
Tip 1 : Do not lie at all
Tip 2 : Have some projects listed
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.
Given the first term A
, the common ratio R
, and an integer N
, your task is to find the Nth term of a geometric progression (GP) series.
The general...
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
Use the formula A * R^(N-1) to find the Nth term of the GP series.
Remember to calculate the result modulo 10^9 + 7.
Handle multiple test cases efficiently to stay within the time limit.
Round duration - 90 minutes
Round difficulty - Easy
Very friendly environment
Tip 1 : Practice DS algorithm
Tip 2 : Practice as many question you can
Tip 3 : Also practice different MCQ question
Tip 1 : Write only things you know
Tip 2 : Be truthful with your resume
based on 3 interviews
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
SDE (Software Development Engineer)
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
4
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech