Gap SDE Interview Questions and Answers

Profit Loss Question, Psychometric question , english ability question

Binary Tree question , array related question, Linked list question

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were of easy to medium level I would say with some lenghty implementations .

Q1. 
Minimum Numbers Required Problem Statement
Given an array 'ARR' consisting of N integers, along with two integers, 'SUM' and 'MAXVAL', you need to determine the minimum number of integers to be added to t...read more
Ans. 
Determine the minimum number of integers to be added to an array to make its sum equal to a given value.
• Iterate through the array and calculate the current sum.

• Determine the difference between the target sum and the current sum.

• Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.
Answered by AI
Add your answer
Q2. 
Maximum Sum Subsequence Problem Statement
Given an array of integers NUMS consisting of N integers and an integer K, determine the maximum sum of an increasing subsequence with exactly K elements.
Exampl...read more
Ans. 
Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.
• Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.

• For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.

• Update the dynamic programming table with the maximum sum found...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.

Q1. 
Check Whether Binary Tree Is Complete
You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.
A Complete Binary Tree is defined as a binary tree where ever...read more
Ans. 
Check if a binary tree is a Complete Binary Tree or not based on given criteria.
• Traverse the binary tree level by level and check if all levels are completely filled except the last one.

• Ensure all nodes at the last level are positioned at the leftmost side.

• Use level order traversal to check for completeness of the binary tree.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.
Answered by AI
Add your answer
Q2. 
Consecutive Elements
Given an array arr of N non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
Input:
The first line of inp...read more
Ans. 
Check if an array of integers consists of consecutive numbers.
• Iterate through the array and check if the absolute difference between consecutive elements is 1.

• Sort the array and check if the elements are consecutive.

• Use a set to store the elements and check if the size of the set is equal to the length of the array.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.

Q1. How can you print numbers from 1 to 100 using more than two threads in an optimized approach?
Ans. 
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
• Divide the range of numbers (1-100) among the threads to avoid duplication.

• Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.

• Consider using a shared data structure like a queue to coordinate the threads.

• Implement a mechanism to signal the threads when to start and stop printing.
Answered by AI
Add your answer
Q2. What are the advantages of using views in a database management system?
Ans. 
Views in a database management system provide data security, simplify complex queries, and improve performance.
• Enhanced security by restricting access to certain columns or rows

• Simplify complex queries by pre-defining joins and filters

• Reduce redundancy by storing commonly used queries as views

• Improve performance by storing pre-processed data in views

• Allow for data abstraction, making it easier to work with complex data...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

Q1. Basic JS & React concepts
Add your answer

System design on the frontned application

Round duration - 90 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Medium

This was the technical round, held around at 10 AM IST on Google Meet.
Firstly she greeted me and asked me to tell something about myself, to which I introduced myself, explaining my academic and some projects also.
After that we moved on to the Hackathon project, which was smart cart self-checkout system. I explained the project along with the code, wherever necessary.
Every word you say while explaining should be clear to you.I used Firebase and SQL while explaining my project, to which she asked some questions related to it, 
Then she moved to the DBMS part, types of joins,what is indexing, how to approach if you were to design a payment system.
At last she asked me some Data Structure questions, which were of medium complexity

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list given the position 'K'.
• Traverse the list to find the length 'N' of the linked list.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Traverse the list again and remove the node at the calculated position.
Answered by AI
Add your answer
Q2. 
House Robber Problem Statement
Consider Mr. X, a professional robber who is planning to rob houses along a street. These houses are arranged in a circle, which means the first house is a neighbor to the l...read more
Ans. 
House Robber problem where adjacent houses have connected security system, find maximum money Mr. X can rob without triggering security.
• Use dynamic programming to keep track of maximum money robbed at each house.

• At each house, decide whether to rob the current house or skip it based on maximum money robbed so far.

• Handle the circular nature of houses by considering two cases: robbing the first house and not robbing the ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The interviewer was very frank and cheerful. This was held at 2:30 PM IST on Google Meet.
He firstly greeted me and asked me how I was doing.
How was my previous round, any technical difficulties?
Then he asked me to introduce myself.
He started telling about his journey to Lowe's and his technical background.
Then he asked some HR related questions

Mostly on js basics. Event loop, hoisting, GraphQL

Q1. How to implement Cadence algorithm
Ans. 
Cadence algorithm is used for real-time stream processing of data.
• Cadence is a distributed system for managing workflows.

• It uses a programming model called the Cadence Workflow Model.

• The Cadence server is responsible for managing the state of workflows.

• The Cadence client is responsible for executing the workflow tasks.

• Cadence provides a lot of features like retries, timeouts, and error handling.
Answered by AI
Add your answer
Q2. How does vdom works in react
Ans. 
VDOM stands for Virtual Document Object Model, which is a lightweight copy of the actual DOM used by React for efficient rendering.
• VDOM is a tree-like structure that React uses to keep track of changes in the UI.

• When a component's state changes, React creates a new VDOM tree and compares it with the previous one to identify the changes.

• React then updates only the parts of the actual DOM that need to be changed, resulti...read more
Answered by AI
Add your answer