
Box8

Box8 Interview Questions and Answers
Q1. There is an amoeba which is doubling his size in every minute. If the size of amoeba was equal to a box at 7 PM then at what time it was half of the box?
The amoeba was half the size of the box at 6:59 PM.
The amoeba doubles in size every minute.
To find when it was half the size, we need to find the time when it was one size smaller than the box.
Since the amoeba doubles in size every minute, it was one size smaller at 6:59 PM.
Q2. A batsman has scored 84 runs in his 12 inning and his average increased by 2 %. how much he has scored in 11th inning.
The batsman scored 80 runs in his 11th inning.
Calculate the original average of the batsman before the 12th inning.
Calculate the new average of the batsman after the 12th inning.
Use the formula: New Average = (Total Runs + Runs in 12th Inning) / (Total Innings)
Calculate the total runs before the 12th inning using the original average.
Subtract the total runs before the 12th inning from the total runs after the 12th inning to get the runs in the 12th inning.
Subtract the runs in...read more
Q3. What is Excel short cut keys?
Excel shortcut keys are key combinations that perform specific tasks in Excel quickly and efficiently.
Ctrl + C: Copy
Ctrl + V: Paste
Ctrl + X: Cut
Ctrl + Z: Undo
Ctrl + Y: Redo
Ctrl + S: Save
Ctrl + P: Print
Ctrl + F: Find
Ctrl + B: Bold
Ctrl + I: Italic
Q4. First element having multiple count
Use a hashmap to store the count of each element in the array and then iterate through the array to find the first element with multiple occurrences.
Create a hashmap to store the count of each element in the array.
Iterate through the array and update the count in the hashmap.
Once the count of an element reaches 2, return that element as the first element with multiple occurrences.
Q5. LCA of generic tree
Find the lowest common ancestor of two nodes in a generic tree.
Traverse the tree to find paths from root to each node
Compare the paths to find the LCA node
Handle cases where one node is ancestor of the other
Q6. Left view of Binary tree
Left view of Binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree level by level from left to right
Keep track of the first node encountered at each level
Example: For a tree with root node A and left children B and C, the left view would be [A, B]
Interview Process at Box8

Top Interview Questions from Similar Companies








Reviews
Interviews
Salaries
Users/Month

