INCREFF Sde1 Interview Questions and Answers

Q1. Group anagrams , coin change problem
Ans. These are pretty basic questions from leetcode
Answered Anonymously
Add your answer

Q1. Subset sum to k
Ans. 
Given an array of integers, determine if there is a subset that sums up to a given target value.
• Use a recursive approach to explore all possible subsets

• At each step, either include the current element or exclude it

• If the target value is reached, return true

• If all elements are exhausted and the target value is not reached, return false
Answered by AI
Add your answer

Q1. Discussion about work I did in previous org
Add your answer

3 questions were asked. 1 easy 1 medium 1 hard

One on one coding round. Basic easy to medium coding questions were asked

Q1. Some coding questions and CS fundamentals were asked
Add your answer
Q2. Projects I had worked on in college
Add your answer

Q1. Basic HR questions were asked
Add your answer

3 DSA questions were there in the coding round

Q1. DSA based question
Add your answer
Q2. DSA question medium level
Add your answer

1 HR of coding round, 2 problems asked. One on stack, one on DP.

Machine coding round where LLD implementation of a cab booking system was asked.

Q1. Past projects were discussed at length
Add your answer
Q2. Behavioural questions were asked
Add your answer

3 questions 1 is easy and 2 medium problems

Q1. Check whether a linked list is palindrome
Ans. 
Check if a linked list is palindrome
• Traverse the linked list and push each element onto a stack

• Traverse the linked list again and compare each element with the top of the stack

• If all elements match, the linked list is a palindrome
Answered by AI
Add your answer
Q2. Diameter of a binary tree
Ans. 
The diameter of a binary tree is the longest path between any two leaf nodes.
• Calculate the height of left and right subtrees recursively

• Find the diameter of left and right subtrees

• Compare the diameter of left and right subtrees and return the maximum
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

In the interview I was asked few puzzles and few coding problems.
In the coding questions the interviewers did not ask me to write down the complete codes of the problems, they only asked me to suggest some suitable algorithms.

Q1. 
Count Set Bits Problem Statement
Given a positive integer N, find the total number of '1's in the binary representation of all the numbers from 1 to N.
You should return the result modulo 10⁹+7 as the co...read more
Ans. 
Count the total number of set bits in the binary representation of numbers from 1 to N, modulo 10^9+7.
• Iterate through numbers from 1 to N and count the set bits in their binary representation

• Use bitwise operations to count set bits efficiently

• Return the total count modulo 10^9+7 as the result
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

In second round of interview I was asked some hardcore programming questions on data structures since I wrote it as my area of interest. 
I was asked some puzzles as well.

Q1. 
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays ARR1 and ARR2 of size M and N, respectively, merge them into ARR1 as one sorted array. Assume that ARR1 has a size of M + N to hol...read more
Ans. 
Merge two sorted arrays into one sorted array in place.
• Iterate from the end of both arrays and compare elements to merge in place

• Use two pointers to keep track of the current position in both arrays

• Handle cases where one array is fully merged before the other
Answered by AI
Add your answer