Reflektive Software Development Engineer 1 Interview Questions and Answers

There were 2 DSA questions.
One was a variation of Kadane's Algorithm and the other one was related to binary trees.

Q1. All CS Fundamentals(OOPS, OS, DBMS, CN)
Add your answer
Q2. Find binary tree if preorder and postorder is given.
Ans. 
To find binary tree from preorder and postorder, use recursion and divide the arrays into left and right subtrees.
• Create a binary tree node using the first element of preorder array

• Find the root node's index in postorder array

• Divide the arrays into left and right subtrees recursively
Answered by AI
Add your answer
Q3. Discussion about the OA questions.
Add your answer

Q1. Projects Discussion and Resume Discussion, some CS questions.
Add your answer
Q2. Word Break question from Leetcode.
Add your answer
Q3. Some questions on sorting techniques.
Add your answer

2 standard DSA question for 1 hour time

1 hr coding text on hackerearth

Q1. Cannot disclose
Add your answer

Q1. Cannot disclose
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

Q1. The question was about Nodejs
Add your answer
Q2. The question was to build a linked list in Nodejs
Add your answer

Q1. The first question was related to DSA
Add your answer
Q2. The question was related to SQL
Add your answer

Q1. 1. Given an array find a subset that sums to a given sum K 2. Given an array with duplicate elements, print all triplets that sum to K. Each element at any index i can only be used once.
Ans. 
Given an array, find a subset that sums to a given sum K and print all triplets that sum to K.
• Use a recursive approach to find subsets that sum to K

• Use a nested loop to find triplets that sum to K

• Avoid using duplicate elements in triplets
Answered by AI
Add your answer

Q1. LLD round 1. Design Book My Show. Interviewer was interested in classes and most common api. He asked more about how will these classes when translated into RDBMS table, will look like. What all index I co...read more
Add your answer

Q1. HLD round 1. Design swiggy 2. Follow up question was to create a state diagram for order object.
Add your answer

Q1. With HM 1. Projects 2. Major challenges during those projects 3. Who all were you stake holders 4. How do you contribute in design discussion 5. How to you plan your testing with QA and other involved team...read more
Add your answer

Q1. With VP of engineering 1. Project discussion. In each scope he asked what if this would fail then how are you handling your code. for eg. Let's say you are reading a file and dumping data in batches in 1 t...read more
Add your answer

Average dsa topics related question.Mostly two pointer related questions were asked;

Providing data analytics based on exploratory data analysis techniques based on python language

Q1. Family background and other tehcnical related questions
Add your answer