Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Mar 2023. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
I appeared for an interview 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.
I appeared for an interview 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.
Top trending discussions
I appeared for an interview before Sep 2016.
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 45 Minutes
Round difficulty - Easy
This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
An E-R Diagram for Uber would include entities like User, Driver, Ride, Payment, and Location.
Entities: User, Driver, Ride, Payment, Location
Relationships: User requests Ride, Driver provides Ride, Payment for Ride
Attributes: User ID, Driver ID, Ride ID, Payment ID, Location ID
Example: User (1) requests Ride (A) from Location (X) to Location (Y) with Driver (Z) providing the Ride and Payment (123) made for the Ride.
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
All the possibl...
Find the path from a leaf node to the root node with the maximum sum in a binary tree.
Traverse the binary tree from leaf nodes to the root while keeping track of the sum of each path.
Compare the sums of all paths and return the path with the maximum sum.
Use recursion to traverse the tree efficiently.
Consider edge cases such as when the tree is empty or has only one node.
Round duration - 30 Minutes
Round difficulty - Easy
The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Create a new linked list to store the sum digits
Handle cases where one list is longer than the other by adding remaining digits with carry
Remember to handle the case where there is a carry after adding all digits
Round duration - 15 Minutes
Round difficulty - Easy
Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.
Tip 1 : Contribute time for course subjects also like OS,DBMS,OOPS.
Tip 2 : Start practicing on Leetcode and InterviewBit 1 month before your Placement Drive and try solving approx 300+ questions.
Tip 3 : Regularly Participate in Coding Contests on CodeForces and try to be Expert.
Tip 1 : Don't try to lie in resume as questions can be asked on the same in depth.
Tip 2 : Mention atleast 1 project or past work experience.
posted on 16 Sep 2021
I appeared for an interview in Nov 2020.
Round duration - 78 minutes
Round difficulty - Easy
My slot was at 4.30 pm on 11 th oct 2020
A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is to minimize the toll costs while ensuring th...
The Fishmonger Toll Optimization Problem involves minimizing toll costs while ensuring timely delivery of goods from a port to a market.
Given 'N' states and a time limit 'M', find the smallest toll amount to reach the market from the port within the given time.
Use dynamic programming to solve the problem efficiently.
Consider the time and toll matrices to calculate the minimum toll cost.
Return -1 if it is not possible t
Round duration - 20 Minutes
Round difficulty - Easy
It happened in the afternoon
Create a base class called Shape
that contains a field named shapeType
and a method printMyType
.
Implement two derived classes:
Create base class Shape with field shapeType and method printMyType. Implement Square and Rectangle classes with calculateArea method.
Create a base class Shape with shapeType field and printMyType method.
Implement Square and Rectangle classes inheriting from Shape.
Include additional fields like length and breadth in Square and Rectangle classes.
Override printMyType method in Square and Rectangle classes to output the t...
ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that either all operations in a transaction are completed successfully or none are.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that the execution...
Round duration - 60 Minutes
Round difficulty - Easy
Yes, I can write an essay on any topic and present it verbally.
Choose a topic that interests you and research it thoroughly
Create an outline with an introduction, body paragraphs, and a conclusion
Use clear and concise language to convey your ideas
Practice presenting your essay verbally to improve your delivery
Engage your audience by maintaining eye contact and using gestures
Be prepared to answer questions or discuss yo
Tip 1 : Practice good aptitude questions
Tip 2 : Read important core subjects thoroughly
Tip 3 : Also revise language basics
Tip 1 : Be honest with your resume
Tip 2 : Try to somehow highlight your strong points in resume
based on 3 interviews
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
12
salaries
| ₹30 L/yr - ₹39.5 L/yr |
SDE (Software Development Engineer)
12
salaries
| ₹36 L/yr - ₹36.5 L/yr |
Software Developer
9
salaries
| ₹30 L/yr - ₹36 L/yr |
Software Development Engineer
9
salaries
| ₹36 L/yr - ₹36.5 L/yr |
Sde1
4
salaries
| ₹34 L/yr - ₹36.5 L/yr |
TCS
Infosys
Wipro
HCLTech