Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by APT Research Private Limited Team. If you also belong to the team, you can get access from here

APT Research Private Limited Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

APT Research Private Limited Data Analytics Interview Questions and Answers

Updated 6 Jan 2022

7 Interview questions

A Data Analytics was asked
Q. 

K-th Largest Number in a BST

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 lar...

Ans. 

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

A Data Analytics was asked
Q. 

Longest Common Prefix Problem Statement

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 hav...

Ans. 

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.

Data Analytics Interview Questions Asked at Other Companies

Q1. Lexicographically Smallest Array Problem Statement You are given ... read more
asked in PwC
Q2. Ways To Make Coin Change Given an infinite supply of coins of var ... read more
Q3. Pair Sum Problem Statement You are given an integer array 'ARR' o ... read more
Q4. Rotting Oranges Problem Statement You are given a grid containing ... read more
Q5. K-th Largest Number in a BST Given a binary search tree (BST) con ... read more
A Data Analytics was asked
Q. 

Rotting Oranges Problem Statement

You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

  • 0 - representing an empty cell
  • 1 - representing a fres...
Ans. 

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.

A Data Analytics was asked
Q. 

Pair Sum Problem Statement

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'.

Note:

...

Ans. 

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.

A Data Analytics was asked
Q. 

Evaluate Division Problem Statement

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 str...

Ans. 

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.

A Data Analytics was asked
Q. 

Peak Element Finder

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 ...

Ans. 

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.

A Data Analytics was asked
Q. 

Lexicographically Smallest Array Problem Statement

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 obtaine...

Ans. 

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.

Are these interview questions helpful?

APT Research Private Limited Data Analytics Interview Experiences

1 interview found

I appeared for an interview in Aug 2021.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Pair Sum Problem Statement

    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'.

    Note:
    ...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Longest Common Prefix Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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.

  • Q1. 

    K-th Largest Number in a BST

    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...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Peak Element Finder

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

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.

  • Q1. 

    Evaluate Division Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Lexicographically Smallest Array Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 8 cgpaA.P.T. PORTFOLIO PVT. LTD. interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Machine LearningTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
1w (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about APT Research Private Limited?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Jun 2016.

Interview Questionnaire 

2 Questions

  • Q1.  Given k and DFS traversal string for a k-ary tree, construct the tree. The String contains P (if a parent) and L (if a leaf). E.g. - k=3, str="PPLLLLL" 2. All the strings are arranged in the following ord...
  • Ans. 

    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

  • Answered by AI
  • Q2. "How would you tell whether a graph has a node with n degree?"
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Questions on C++(Virtual fns, inheritance). Two on probability, 12 on Algorithms
Duration: 45 minutes

Round: Technical + HR Interview
Experience: He asked some more puzzles and some probability (expectation) questions. Then, he modified one question asked in the written test and asked me write code for it on paper.
Tips: First of all, prepare all the questions asked in the test before going for the interviews.


Skills evaluated in this interview

Data Analytics Interview Questions Asked at Other Companies

Q1. Lexicographically Smallest Array Problem Statement You are given ... read more
asked in PwC
Q2. Ways To Make Coin Change Given an infinite supply of coins of var ... read more
Q3. Pair Sum Problem Statement You are given an integer array 'ARR' o ... read more
Q4. Rotting Oranges Problem Statement You are given a grid containing ... read more
Q5. K-th Largest Number in a BST Given a binary search tree (BST) con ... read more

I appeared for an interview in May 2022.

Round 1 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.

  • Q1. 

    Best Time to Buy and Sell Stock Problem Statement

    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...

  • Ans. 

    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...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Dance Team Pairing Challenge

    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...

  • Ans. 

    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...

  • Answered by AI
  • Q2. What is the difference between multiprocessing and multithreading?
  • Ans. 

    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...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Hard

  • Q1. Can you describe the classes and functions involved in the design of a system like Splitwise?
  • Ans. 

    Splitwise is a system for managing shared expenses among groups of people.

    • Classes: User, Expense, Group

    • Functions: addExpense(), settleUp(), calculateBalance()

  • Answered by AI
Round 4 - Video Call 

Round duration - 60 Minutes
Round difficulty - Hard

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in GurgaonEligibility criteriaNo criteriaTower Research Capital interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Low level design, High Level Design, Relational Database Management Systems, Operating SystemsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I appeared for an interview in Nov 2024, where I was asked the following questions.

  • Q1. Experience with tech stack
  • Ans. 

    I have extensive experience with various tech stacks, including front-end, back-end, and database technologies.

    • Proficient in JavaScript frameworks like React and Angular for building dynamic user interfaces.

    • Experienced with back-end technologies such as Node.js and Express for server-side development.

    • Skilled in using databases like MongoDB and PostgreSQL for data storage and management.

    • Familiar with cloud services like...

  • Answered by AI
  • Q2. Discussion Regarding CTC
  • Q3. Where do you see yourself after 5 years?

I applied via Naukri.com and was interviewed before May 2020. There was 1 interview round.

Interview Questionnaire 

4 Questions

  • Q1. OOPS Concepts
  • Q2. MySql
  • Q3. Php
  • Q4. Design Patterns

Interview Preparation Tips

Interview preparation tips for other job seekers - Just get your basics right.

I applied via Referral

Interview Preparation Tips

Round: Technical Interview
Experience: details of the initial interview process?
• Group discussions
• Case study Analysis , presentations etc
• Assessment centre
• Management games etc
• Panel / one on one interview – First round was primarily a personal interview
with their CEO and the HR head. Interview centered around my resume, my
background and other personal questions.
• Telecon interviews – Final round was a telecom with most of the technical
team (about 5 of them) – which was primarily technical and about projects I
did.
• Video conferencing etc
Tips: On resume – brushing up on projects I have done; making sure past mistakes
are not repeated; and identifying primary focus areas where I can sell myself
better; in fact I modified the order of my projects in my resume a little bit to
put the equities project I have done at the very top.
• Communication skills
• Mock interview practice – 1-2 mock interviews; I had done enough already
for prior interviews
• Collecting information of company / role – researched company website; read
DSP’s market outlook report; and found out what types of funds they have.
• Technical / subject / functional preparations – read quite a bit on Portfolio
Management (from a book in lib – don’t remember the author’s name);
reviewed O&F fundaas and IA fundaas..
• PPT’s stage

College Name: Indian School Of Business (ISB)
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about your self
  • Q2. How many work experience
Round 3 - HR 

(1 Question)

  • Q1. What is expectation for salary
Are these interview questions helpful?
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Coding Test 

DSA medium level questions were asked.

Round 2 - One-on-one 

(2 Questions)

  • Q1. Design MakeMyTrip kind of application.
  • Ans. 

    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...

  • Answered by AI
  • Q2. Oops based questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well for LLD.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Mar 2024.

Round 1 - Coding Test 

Leetcode simple problems. But with coding

Round 2 - Coding Test 

C++ basics and operating systems basic

Round 3 - Technical 

(2 Questions)

  • Q1. C++ templates and advanced c++
  • Q2. Low level design

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.

  • Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
  • Ans. 

    To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.

    • Understand the problem statement and expected output.

    • Review the code for syntax errors, logical errors, and potential bugs.

    • Use debugging tools like breakpoints, print statements, and IDE debuggers.

    • Test the code with different inputs to identify the bug.

    • Make necessary corrections based on the iden...

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.

    • Traverse the binary tree to find the target node.

    • Use BFS to traverse the tree from the target node to nodes at distance K.

    • Keep track of the distance while traversing the tree.

    • Return the values of nodes at distance K in any order.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

  • Q1. 

    Subarray Challenge: Largest Equal 0s and 1s

    Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.

    Input:

    Input beg...

  • Ans. 

    Find the length of the largest subarray with equal number of 0s and 1s in a given array.

    • Iterate through the array and maintain a count of 0s and 1s encountered so far.

    • Store the count difference in a hashmap with the index as the key.

    • If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

    • Return the length of the longest subarray found.

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.

Interview Preparation Tips

Eligibility criteriaNeeded Work Experience in a leading Tech CompanyTower Research Capital interview preparation:Topics to prepare for the interview - Dynamic Programming, Data Structures - Sets, HashMap, Priority Queue, SQL, OOPS, Operating System, AlgorithmsTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.

Application resume tips for other job seekers

Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Tell us how to improve this page.

Devops Engineer
14 salaries
unlock blur

₹7 L/yr - ₹29 L/yr

Software Engineer
8 salaries
unlock blur

₹22 L/yr - ₹40.9 L/yr

Production Support Engineer
7 salaries
unlock blur

₹25 L/yr - ₹37.7 L/yr

Executive Accountant
6 salaries
unlock blur

₹5.3 L/yr - ₹13.2 L/yr

Software Developer
4 salaries
unlock blur

₹13 L/yr - ₹35 L/yr

Explore more salaries
Compare APT Research Private Limited with

Resurgent India

4.3
Compare

Belstar Investment and Finance

4.1
Compare

Cholamandalam Securities

3.4
Compare

Link Intime

3.5
Compare
write
Share an Interview