i
APT Research Private Limited
Filter interviews by
I appeared for an interview in Aug 2021.
Round duration - 90 Minutes
Round difficulty - Medium
The round was of 90 minutes.
The first section had 3 coding questions. (leetcode mediums)
The second section had problems based on probability and linear algebra and general mathematics.
The third section had MCQs based on some puzzles and cs fundamentals.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the first element of each pair, and then the second element if the first elements are equal.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Iterate through the grid to find rotten oranges and their adjacent fresh oranges.
Use BFS or DFS to simulate the rotting process and track the time taken.
Return the minimum time taken to rot all fresh oranges or -1 if not possible.
You are given an array ‘ARR’ consisting of ‘N’ strings. Your task is to find the longest common prefix among all these strings. If there is no common prefix, you ha...
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with corresponding characters of other strings.
Stop when a mismatch is found or when reaching the end of the shortest string.
Return the prefix found so far as the longest common prefix.
Round duration - 45 Minutes
Round difficulty - Easy
This round started with a brief discussion about my projects and previous internship(about 15 mins).
Then it was followed by 2 coding questions(10-12 mins for the first question and 15 mins for the second question).
The interviewer asked me if I had any questions. I asked 2-3 questions about the projects we will be working on the what exactly the company does.
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...
Find the K-th largest element in a binary search tree.
Perform an in-order traversal of the BST to get elements in ascending order
Return the (N-K)th element from the end of the in-order traversal
Handle cases where K is out of bounds or no K-th largest element exists
For a given array of integers arr
, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, if arr[i]
is the peak, then both...
Find the peak element in an array of integers.
Iterate through the array and check if the current element is greater than its neighbors.
Handle edge cases where the first or last element can be a peak.
Return the peak element found.
Round duration - 70 Minutes
Round difficulty - Easy
It was a mix of HR+technical round. A senior person from the company took my interview. He first asked me about my interests and why I want to join this company and about my future goals. He then asked my favourite topic, and I said graphs. Then we had a good discussion on graphs and the different concepts and popular algorithms. Then he asked 2 coding questions, one related to graphs and one related to backtracking.
After this, we had a brief discussion of some of my ML projects.
Given an array of pairs of strings equations
representing a fraction and an array of real numbers values
. Each element in equations
denotes a fraction with the first st...
Evaluate division problem statement with given fractions and values to calculate the value of a given fraction.
Use a graph data structure to represent the fractions and values.
Perform depth-first search (DFS) to find the value of the given fraction.
Multiply the values of the fractions along the path from numerator to denominator to get the final result.
You are given an array ARR
of 'N' integers and a positive integer 'K'.
Your task is to determine the lexicographically smallest array that can be obtain...
The task is to determine the lexicographically smallest array that can be obtained by performing at most 'K' swaps of consecutive elements.
Iterate through the array and swap elements to make the array lexicographically smallest.
Keep track of the number of swaps made and stop when the limit 'K' is reached.
Use a sorting algorithm to find the lexicographically smallest array after at most 'K' swaps.
Tip 1 : Start early and practice problems regularly.
Tip 2 : Give at least one contest in a week and upsolve the problems after the contest is over.
Tip 3 : For Machine Learning/ Data Science Roles, have a clear understanding of the basics like Linear Algebra, Probability.
Tip 1 : It is good to have an internship or some projects in your resume.
Tip 2 : Don't put some high-level ml algorithms in your resume unless you know the theory behind those algorithms.
Top trending discussions
posted on 26 Jun 2017
I appeared for an interview before Jun 2016.
The question asks to construct a k-ary tree using the given k and DFS traversal string.
Iterate through the DFS traversal string
If the current character is 'P', create a parent node
If the current character is 'L', create a leaf node
Link the nodes according to the DFS traversal order
To determine if a graph has a node with n degree, iterate through all nodes and count their edges.
Iterate through each node in the graph
Count the number of edges connected to each node
If any node has n edges, then the graph has a node with n degree
posted on 28 May 2022
I appeared for an interview in May 2022.
Round duration - 45 Minutes
Round difficulty - Easy
The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.
Given an array prices
representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...
Find the maximum profit by buying and selling a stock once based on given prices.
Iterate through the prices 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, ensuring it is not negative.
Example: prices = [2, 100, 150, 120], Buy at 2, sell a
Round duration - 60 Minutes
Round difficulty - Medium
Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N
, the number of girls M
, a...
The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.
Parse the input to get the number of test cases, boys, girls, and potential pairings.
Iterate through the potential pairings and form pairs based on the given indexes.
Output '1' if a set of maximum possible pairs is returned, else output '0'.
There can be multiple valid configurations of pa...
Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.
Multiprocessing utilizes multiple processes to execute tasks simultaneously.
Multithreading involves multiple threads within a single process sharing the same memory space.
Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.
E...
Round duration - 60 Minutes
Round difficulty - Hard
Splitwise is a system for managing shared expenses among groups of people.
Classes: User, Expense, Group
Functions: addExpense(), settleUp(), calculateBalance()
Round duration - 60 Minutes
Round difficulty - Hard
Tip 1 : Practice at least 5 questions of each topic of various difficulty levels
Tip 2 : Read out theory articles about your preferred language showing your proficiency in the same.
Tip 3 : Hard work is overrated, consistency is the key.
Tip 1 : Own everything you have there, do not add random skills that you are not proficient in.
Tip 2 : Keep it clean and try to give out minimal but most of the relevant information for the role.
posted on 26 Dec 2015
I applied via Referral
posted on 16 Sep 2024
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
DSA medium level questions were asked.
MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.
Include features like flight/hotel search, booking, payment gateway integration, and user profiles.
Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.
Integrate maps for location tracking, weather forecasts, and customer support chatbot.
Offer discounts, loyalty p...
posted on 10 May 2021
I applied via Naukri.com and was interviewed before May 2020. There was 1 interview round.
posted on 7 Sep 2023
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
I analyze various factors such as revenue growth, market share, competitive landscape, and future prospects to determine the valuation of technology companies.
I research and analyze financial statements, industry reports, and market trends.
I consider the company's revenue growth, market share, and competitive landscape.
I evaluate the company's future prospects and potential for innovation.
I use various valuation method...
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 3 interview rounds.
Aptitude test was the mixture of common aptitude questions along with sql, basic javascript and java language basic questions and couple of simple coding questions like febinachi series, palindrom pattern etc .
Objects in Java can be created using the 'new' keyword, constructors, and factory methods.
Use the 'new' keyword followed by the class name to create an object
Objects can also be created using constructors to initialize the object's state
Factory methods can be used to create objects without exposing the instantiation logic
posted on 29 Jan 2024
I applied via Campus Placement and was interviewed in Dec 2023. There were 4 interview rounds.
There was basic GD topic
Count the number of words and their frequency
Split the given text into words using whitespace as delimiter
Create a dictionary to store the word frequency
Iterate through each word and update the frequency in the dictionary
Return the dictionary with word frequency
Count the frequency of characters in a given string.
Iterate through the string and use a hash map to store the count of each character.
Initialize the count of each character to 0 and increment it as you encounter the character.
Finally, iterate through the hash map to get the frequency of each character.
Reverses an array of strings
Use a loop to iterate through half of the array
Swap the elements at the current index with the corresponding element from the end of the array
Implementing the comparator function for sorting an array of strings.
Use the built-in sort() function in most programming languages.
Define a custom comparator function that compares two strings.
Return a negative value if the first string should come before the second, a positive value if it should come after, and 0 if they are equal.
Example: ['apple', 'banana', 'cherry'] can be sorted in alphabetical order using the co
Devops Engineer
14
salaries
| ₹7 L/yr - ₹28.7 L/yr |
Software Engineer
9
salaries
| ₹13 L/yr - ₹22.7 L/yr |
Production Support Engineer
7
salaries
| ₹25 L/yr - ₹42 L/yr |
Executive Accountant
6
salaries
| ₹5.5 L/yr - ₹12 L/yr |
Senior Accounts Executive
5
salaries
| ₹12 L/yr - ₹25 L/yr |
Muthoot Homefin India
Belstar Investment and Finance
Cholamandalam Securities
Link Intime