Freo SDE (Software Development Engineer) Interview Questions and Answers

Hackerrank - dp problems

Q1. Minimum number of jumps in the array.
Ans. 
Find minimum number of jumps required to reach the end of an array.
• Use dynamic programming approach to solve the problem.

• Maintain an array to store minimum number of jumps required to reach each index.

• Traverse the array and update the minimum number of jumps for each index.

• Return the minimum number of jumps required to reach the end of the array.
Answered by AI
Add your answer

Q1. What are ambitions and how I'll approach them
Add your answer
Q2. How do I see myself in 5 years
Add your answer

Q1. One medium and one hard leetcode question.
Add your answer
Q2. Some Golang concepts and goroutines implementation.
Add your answer

Q1. Engineering Manager Round, grilled about my resume, past work experience. Some generic questions like why are you switching etc.
Add your answer
Q2. HLD of IND Money's basic features. Need to draw HLD on draw dot io. Used Microservices Architecture.
Add your answer
Q3. Parking lot database design. Some requirements were given, needed to design the tables required, their relationships and answer some follow up questions.
Add your answer

Q1. This was taken by CTO. He was really nice to talk to. First he gave a DSA kind of question for which I took a lot of time. Asked me a few more technical as well as generic questions. Overall was a good rou...read more
Add your answer

DS, Algo, DP, Greedy, Stack, Heap

Q1. System Design a DropBox
Ans. 
Design a scalable cloud storage system similar to DropBox.
• Use distributed file system for storing files across multiple servers.

• Implement data deduplication to save storage space.

• Use client-side encryption for security.

• Implement file synchronization across devices.

• Utilize load balancing to distribute user requests.

• Implement version control for files.

• Use metadata for efficient file organization.
Answered by AI
Add your answer
Q2. Design a Linked List
Ans. 
A linked list is a linear data structure where each element is a separate object with a reference to the next element.
• Start with a Node class that has data and a reference to the next node

• Create a LinkedList class that manages the nodes and provides methods like insert, delete, and search

• Example: Node class - data, next; LinkedList class - head, insert(data), delete(data), search(data)
Answered by AI
Add your answer

Q1. About yourself. Projects worked upon
Add your answer
Q2. Why want to join Ocrolus?
Add your answer

Q1. Data Structure and algorithm
Add your answer
Q2. System design question
Add your answer

Q1. How dis you tackle the one incident where you disagree with the team lead approach?
Add your answer
Q2. How do you make sure to deliver on time when there are uncertainty?
Ans. 
To deliver on time despite uncertainty, I prioritize tasks, communicate effectively, set realistic deadlines, and have contingency plans.
• Prioritize tasks based on importance and impact on project timeline

• Communicate effectively with team members and stakeholders to address any uncertainties or roadblocks

• Set realistic deadlines taking into account potential delays or uncertainties

• Have contingency plans in place to mitig...read more
Answered by AI
Add your answer

Q1. Design Patterns
Add your answer
Q2. Sorting Algorithms
Add your answer

Design HR Management System