A.P.T. Portfolio Interview Questions, Process, and Tips

2 coding questions based on DSA.

Q1. Easy coding problem.
Add your answer
Q2. Medium coding problem.
Add your answer

2 Hour test comprising of CP questions. Basic leetcode

Q1. How to make a fair game out of an unfair die that shows heads with a prob p
Ans. 
To make a fair game out of an unfair die showing heads with probability p, we can introduce a penalty for rolling heads.
• Introduce a penalty for rolling heads, such as losing a point or skipping a turn.

• Adjust the game rules to account for the unfair die, ensuring that the penalty balances out the advantage of rolling heads.

• Consider incorporating strategic elements or decision-making to mitigate the impact of the unfair
Answered by AI
Add your answer

Q1. Basic Introduction about yourself
Add your answer
Q2. We would like to hire you
Ans. 
I am excited about the opportunity to contribute my skills and experience to your team.
• I have a strong background in trade analysis, with experience in market research and forecasting.

• I am proficient in data analysis tools such as Excel, Tableau, and SQL.

• I have a proven track record of delivering actionable insights and recommendations to drive business growth.

• I am a team player and thrive in a fast-paced, collaborativ...read more
Answered by AI
Add your answer

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
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair eq...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered by CodingNinjas
View 2 more answers
Q2. Rotting Oranges
You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:
Value 0 - representing an empty cell.
Value 1 - representing a fresh...read more
Ans. Naïve Solution
The idea is very simple and naive. We will process the rotten oranges second by second. Each second, we rot all the fresh oranges that are adjacent to the already rotten oranges. The time by which there are no rotten oranges left to process will be our minimum time.
 
In the first traversal of the grid, we will process all the cells with value 2 (rotten oranges). We will also mark their adjacent cells ...read more
Answered by CodingNinjas
View 1 more answer
Q3. Longest Common Prefix
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 have to return an emp...read more
Ans. Iterative Scanning
In this approach, we will iterate through each character of the first string and check if the same character exists in each string or not. We will maintain a variable longestPrefix to store the longest common prefix.
 
We will traverse idx from 0 to the length of ARR[0] -1.
1. We will iterate index from 1 to N-1 and check if ARR[index][idx] is equal to ARR[0][idx].
2. If the condition is true for all strin...read more
Answered by CodingNinjas
View 3 more answers

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 BST
You are given a binary search tree of integers with 'N' nodes. Your task is to return the K-th largest element of this BST.
If there is no K-th largest element in the BST,...read more
Ans. Inorder Traversal
We can store all the elements of the BST in ascending order in an array/list with the help of one inorder traversal. We can then return the K-th largest element from it.
 
The algorithm will be-
• In each recursive call, we will-
  • Recurse over the left subtree.
  • Insert the data associated with the current node in an array/list.
  • Recurse over the right subtree.
• If the number of nodes is less than ‘K’ we return...read more
Answered by CodingNinjas
View 1 more answer
Q2. Find Peak Element
Given an array of ‘n’ integers arr. Find the Peak element of the array. The peak element of an array is defined as that element which is greater than both of its neighbours. I.e if arr[i]...read more
Ans. Brute force approach
• The key idea is to check if each element is a peak or not.
• To do that we first check if one of the first or last element is peak.
• For that, we simply check if the array is sorted in increasing or decreasing order.
• Otherwise, we take a loop from index=1 and for each element, compare it to its left and right element to see if it is greater than both of them.
• If it is, we have found the peak element and we...read more
Answered by CodingNinjas
View 1 more answer

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
You are given an array of pairs of strings 'EQUATIONS', and an array of real numbers 'VALUES'. Each element of the 'EQUATIONS' array denotes a fraction where the f...read more
Ans. DFS based Approach
The idea is to construct a weighted directed graph from the given equations. For each given equation, let’s make an edge from the numerator variable to the denominator variable with weight equal to the value of the equation and another edge from the denominator to the numerator with weight equal to the inverse of the value of the equation. After making the graph to solve any query, we will need to fin...read more
Answered by CodingNinjas
View 2 more answers
Q2. Lexicographically Smallest Array
You have been given an array/list ARR consisting of ‘N’ integers. You are also given a positive integer ‘K’.
Your task is to find the lexicographically smallest ARR that ...read more
Ans. Greedy Approach
Looking at the problem, we observe that-
• The lexicographically smallest ARR is obtained if the smallest element is present at the beginning i.e ARR[0], followed by the next smallest at index 1 (ARR[1]) and so on.
• The number of swaps to move an element from index ‘i’ to index ‘j’ (where i > j) is i - j as we can swap only neighbouring elements.
• The maximum swaps allowed are ‘K’.
 
Keeping the above poi...read more
Answered by CodingNinjas
Add your answer

Q1. Basic linux and windows server related questions
Add your answer

Q1. Work experience and job profile and salary discussion.
Add your answer