FreshToHome Software Developer Interview Questions and Answers

Coding test with Java and dsa questions

Q1. Core Java Questions
Add your answer
Q2. Maximum subbarray
Add your answer

High level language

Q1. One on one coding interview
Add your answer

Q1. Basic questions about your life
Add your answer

Problems , ap hp, figures

It was basically on c

Why choose my company

Q1. Why did you choose our company
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer

Q1. Code postorder traversal without using recursion.
Ans. 
Iterative solution using a stack to perform postorder traversal.
• Use a stack to simulate the recursive call stack.

• Push nodes in the order of right, left, root.

• Pop nodes from stack and add to result array.

• Repeat until stack is empty.
Answered by AI
Add your answer
Q2. Leetcode Problem 1626 - Best team with no conflicts.
Add your answer

Q1. Design whatsapp with one to one, group messaging and read receipts functionalities. Design the database.
Ans. 
Design a messaging app like WhatsApp with one-to-one, group messaging, and read receipts functionalities.
• Use a relational database to store user information, messages, and group memberships.

• Create tables for users, messages, groups, and group memberships.

• Include columns for message content, sender, receiver, timestamp, and read status.

• Implement a feature to mark messages as read with read receipts.

• Use indexes for effic
Answered by AI
Add your answer
Q2. Questions on dbms, cn and os.
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Round duration - 120 minutes
Round difficulty - Medium

- Discussion on the first round's assignment
- Was asked about adding unit tests in the assignment
- Fundamental questions on the approach used for the assignment.

Q1. What are some things that could have been done better in the system design problem given in the first round?
Ans. 
Some improvements in the system design problem could include better scalability planning, more efficient data storage solutions, and improved error handling.
• Implementing a more robust caching mechanism to improve performance under heavy load.

• Optimizing the database schema for better query performance and scalability.

• Introducing load balancing and horizontal scaling to handle increased traffic.

• Enhancing error handling t...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Round was with tech lead. Was briefly asked about the problem I solved in the first round. Then I was asked to solve 1 medium level DSA based question. Some discussion on culture fit was also done.

Q1. Given the frequency of traffic lights' states, can you determine if there will ever be an invalid state for the traffic signal, and what are the conditions that lead to an invalid state?
Ans. 
Yes, an invalid state can occur if the traffic lights are in conflicting states simultaneously.
• An invalid state occurs when multiple traffic lights are showing conflicting signals, such as both red and green at the same time.

• This can happen due to a malfunction in the traffic light system or human error in programming the lights.

• For example, if a traffic light is stuck showing both red and green signals, it would be co
Answered by AI
Add your answer