i
APT Research Private Limited
Filter interviews by
3 coding questions
A time series database stores data points with timestamps for efficient retrieval and analysis.
Choose a suitable data model for the database
Use a time-based partitioning scheme for efficient data retrieval
Implement compression techniques to reduce storage requirements
Support for querying and analyzing time-based data
Ensure data consistency and durability
Consider scalability and high availability
Examples: InfluxDB, Time
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 10 May 2021
I applied via Naukri.com and was interviewed before May 2020. There was 1 interview round.
posted on 5 Mar 2025
I appeared for an interview before Mar 2024.
Leetcode simple problems. But with coding
C++ basics and operating systems basic
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 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
posted on 29 Jan 2025
I appeared for an interview in Dec 2024.
Topic: Online vs Offline Education.
They gave us 8 coding problems and instructed us to solve 5 within a time limit of 1 hour and 30 minutes; all problems were from the easy and medium on LeetCode.
posted on 28 May 2022
I appeared for an interview in Feb 2022.
Round duration - 90 minutes
Round difficulty - Easy
Consisted of 3 DSA questions and MCQ on python proficiency
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome by comparing it with its reverse.
Store all palindromic substrings in a set to ensure uniqueness.
Return the sorted list of palindromic substrings.
Round duration - 60 minutes
Round difficulty - Medium
It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems
Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.
The grid has only one i...
Calculate the perimeter of an island represented by a binary grid.
Iterate through the grid and count the perimeter based on land cells and their adjacent cells.
Each land cell contributes 4 units to the perimeter, subtract 2 units for each adjacent land cell.
Handle edge cases where land cells are at the boundaries of the grid.
Return the total perimeter for each test case.
Round duration - 60 minutes
Round difficulty - Hard
DSA+OS
Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...
Calculate the minimum number of steps Ninja needs to cut down all trees in a forest grid.
Iterate through the grid to find the shortest path to cut down all trees in order.
Use a priority queue to keep track of the shortest trees to cut next.
If it's impossible to cut all trees, return -1.
Consider all four cardinal directions for movement in the grid.
Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional
posted on 28 May 2022
I appeared for an interview in Jun 2022.
Round duration - 70 Minutes
Round difficulty - Hard
The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N
houses numbered from 1 ...
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the path taken to reach each house.
Once the destination house is reached, backtrack from destination to source to find the shortest path.
Consider using a queue data structure to implement BFS eff...
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a
and b
. Your task is to determine if ...
Check if two nodes in a binary tree are cousins by comparing their levels and parents.
Traverse the tree to find the levels and parents of the given nodes.
Compare the levels and parents of the two nodes to determine if they are cousins.
If the levels are the same and the parents are different, the nodes are cousins.
Round duration - 60 Minutes
Round difficulty - Medium
It contained two programming questions.
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...
Count the total number of nodes in a complete binary tree given its root.
Traverse the tree in level order and count the nodes
Use a queue to keep track of nodes at each level
Check for null nodes represented by -1 in the input
The total number of nodes in the example tree is 7
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...
Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.
Convert integers in the array to strings for easier manipulation.
Sort the array of strings in non-increasing order based on custom comparison function.
Join the sorted strings to form the largest possible number.
Round duration - 60 Minutes
Round difficulty - Medium
This was more of a interaction round with some technical skills.
ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.
ACID properties: Atomicity, Consistency, Isolation, Durability
Atomicity ensures all operations in a transaction are completed successfully or none at all
Consistency ensures database remains in a valid state before and after transaction
Isolation ensures transactions are independent and do not inter...
Tip 1 : Focus on different varieties of problems, quality of problems matter greater than the quantity.
Tip 2 : Focus on design thinking, that will help in rounds other than problem solving.
Tip 1 : Focus on demonstrating your academic excellence and course projects
Tip 2 : Mention internship details with clarity
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