Box8 Software Development Engineer Intern Interview Questions and Answers

Q1. Sort an array in O(nlogn)
Ans. 
Use merge sort algorithm to sort the array in O(nlogn) time complexity.
• Implement merge sort algorithm which divides the array into two halves, recursively sorts the halves, and then merges the sorted halves.

• Time complexity of merge sort is O(nlogn) where n is the number of elements in the array.

• Example: ['apple', 'banana', 'cherry', 'date'] can be sorted using merge sort in O(nlogn) time complexity.
Answered by AI
Add your answer
Q2. Find element in sorted Array
Ans. 
Use binary search to find element in sorted array efficiently.
• Start with middle element and compare with target

• If target is less, search left half, if greater search right half

• Repeat until element is found or search space is empty
Answered by AI
Add your answer

Dsa, trees, graphs, oops, tech question

Q1. Oops, dbms, dsa, networks
Add your answer

Q1. Use of model in laravel
Ans. 
Models in Laravel are used to interact with the database and represent data.
• Models in Laravel are used to perform database operations such as retrieving, inserting, updating, and deleting data.

• Models help in organizing and structuring the data in the application.

• Models in Laravel follow the MVC (Model-View-Controller) pattern.

• Example: Creating a User model in Laravel to interact with the users table in the database.
Answered by AI
Add your answer
Q2. SQL get highest salary for employee
Add your answer

Q1. SQL joins and types of joins
Ans. 
SQL joins are used to combine rows from two or more tables based on a related column between them.
• Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

• INNER JOIN returns rows when there is at least one match in both tables.

• LEFT JOIN returns all rows from the left table and the matched rows from the right table.

• RIGHT JOIN returns all rows from the right table and the matched rows from the left table.

• F...read more
Answered by AI
Add your answer
Q2. What is self join and realted question
Add your answer

Q1. Previous projects and contributions
Add your answer

Q1. Basic Php ,Oops
Add your answer

Q1. Security questions
Add your answer

It was an online assessment. Some coding questions. Some cs fundamental mcqs. SQL query, Rest Api question.

An assignment to create a game using nodejs/ go lang/ java.

Q1. Discussion related to Assignment. Told some changes and told to add some more functionalities.
Add your answer
Q2. Some APIS were given. It was case study. You had to show the dishes to a customer according to his preferences.
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

Q1. 
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...read more
Ans. 
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
• Use dynamic programming to solve the problem efficiently.

• The number of structurally unique BSTs can be calculated using Catalan numbers.

• For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

• Example: For N=3, the number of structurally unique BSTs is 5.
Answered by AI
Add your answer
Q2. 
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...read more
Ans. 
Generate all possible subsequences of a given string.
• Use recursion to generate all possible subsequences by including or excluding each character in the string.

• Maintain a current index to keep track of the characters being considered.

• Append the current character to each subsequence generated so far.

• Recursively call the function with the next index to include or exclude the next character.

• Base case: When the current ind...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

Q1. 
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...read more
Ans. 
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
• Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

• Compare the two lists and find the last common node.

• Return the last common node as the lowest common ancestor.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Ans. 
The problem is to find a subarray with the maximum sum in a given array.
• Iterate through the array and keep track of the maximum sum and the current sum.

• If the current sum becomes negative, reset it to 0.

• Update the maximum sum if the current sum is greater.

• Also keep track of the start and end indices of the subarray with the maximum sum.

• Return the subarray using the start and end indices.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in an array.
• Iterate through the array from right to left.

• Use a stack to keep track of the elements that have a greater element to their right.

• For each element, pop elements from the stack until a greater element is found or the stack is empty.

• If a greater element is found, it is the next greater element for the current element.

• If the stack becomes empty, the...read more
Answered by AI
Add your answer
Q2. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right side of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

• Sum up the amount of water trapped at each bar to get the total amo
Answered by AI
View 5 more answers

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc