Buyhatke Software Development Engineer Intern Interview Questions and Answers

There were 2 questions, first one was the three sum problem of leetcode and the second one was related to stacks amd strings

Q1. What is encapsulation in OOP?
Ans. 
Encapsulation is the concept of bundling data and methods together within a class, hiding internal details from the outside world.
• Encapsulation helps in achieving data abstraction and data hiding.

• It allows for better control over the access to the internal state of an object.

• By encapsulating data, we can protect it from being modified by external code.

• Encapsulation promotes code reusability and maintainability.

• Example:...read more
Answered by AI
Add your answer

Q1. DSA question with Some Stack
Add your answer
Q2. Discussion around Current project
Add your answer

Q1. Managerial discussion around resume and some basic java and spring question
Add your answer
Q2. Java and spring boot question
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

Easy level to Medium level

2 Easy questions of DSA

Q1. One DSA question
Add your answer
Q2. Normal discussion about tech stack
Add your answer

Q1. Tell about yourself
Add your answer
Q2. Why do you want to join digit?
Add your answer

Easy to medium questions, Questions on DSA and Node.js.

Q1. Valid parenthesis
Add your answer
Q2. Three sum problem
Add your answer

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...read more
Add your answer
Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Add your answer

Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...read more
Add your answer

Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Add your answer