Algo8 interview experience Real time questions & tips from candidates to crack your interview

Product Intern

Algo8
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data Structures - Arrays, Strings, Stacks, Queues, Recursion, Hash maps, Trees, Pointers,Dynamic Programming, Operating Systems - OS Kernel, Deadlock, Virtual Memory, Memory Management, Paging, Segmentation, Object Oriented Programming, Puzzles
Tip
Tip

Tip 1 : Confidence is the key to excel any interview. Practice more questions and build up your confidence level. 
Tip 2 : Understand the concepts first behind each algorithm and try to solve around 20-25 questions for each data structure. Practice the data structure portion from Codezen(they have really good content coverage and the right pool of questions), read few interview experiences from Geeks for Geek and the Algorithm questions from Leetcode.
Tip 3 : In an interview, if you get stuck in any question, don't panic. Try to ask about the constraints and cases from the interviewer and extract hints from it. Interviewers usually help you to reach to a solution.

Application process
Where: Campus
Eligibility: No
Resume Tip
Resume tip

Tip 1 : Keep it short and crisp. Utilise one full page wisely to describe yourself. It should not be more than a page.
Tip 2 : Focus on the Projects/Work Experience and Achievements Section.

Interview rounds

01
Round
Easy
Online Coding Test
Duration95 minutes
Interview date8 Jul 2020
Coding problem1

It was easy not much difficult , if your basics were clear then you can easily pass this round .

1. Colorful Knapsack

Hard
45m average time
0/120
Asked in companies
AdobeSamsungGoogle

You are given 'N' stones labeled from 1 to 'N'. The 'i-th' stone has the weight W[i]. There are 'M' colors labeled by integers from 1 to 'M'. The 'i-th' stone has the color C[i] which is an integer between 1 to 'M', both inclusive.

You have been required to fill a Knapsack with these stones. The Knapsack can hold a total weight of 'X'.

You are required to select exactly 'M' stones; one of each color. The sum of the weights of the stones must not exceed 'X'. Since you paid a premium for a Knapsack with capacity 'X', you are required to fill the Knapsack as much as possible.

Write a program to calculate the best way to fill the Knapsack - that is, the unused capacity should be minimized.

Try solving now
02
Round
Easy
Telephonic
Duration20 minutes
Interview date22 Jul 2020
Coding problem2

They just give basic questions

1. OS Questions

Asked concepts like - Segmentation, Swapping using Virtual Memory, Kernel .

Problem approach

Tip 1 : I had read the OS concepts from the book Galvin.
Tip 2 : Try to give real life examples after explaining the concepts.

2. Puzzle

Egg Dropping Puzzle

The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors.

Suppose that we wish to know which stories in a 36-story building are safe to drop eggs from, and which will cause the eggs to break on landing. We make a few assumptions:

1) An egg that survives a fall can be used again.
2) A broken egg must be discarded.
3) The effect of a fall is the same for all eggs.
4) If an egg breaks when dropped, then it would break if dropped from a higher floor.

5) If an egg survives a fall then it would survive a shorter fall.
6) It is not ruled out that the first-floor windows break eggs, nor is it ruled out that the 36th-floor do not cause an egg to break.

If only one egg is available and we wish to be sure of obtaining the right result, the experiment can be carried out in only one way. Drop the egg from the first-floor window; if it survives, drop it from the second-floor window. Continue upward until it breaks. In the worst case, this method may require 36 droppings. Suppose 2 eggs are available. What is the least number of egg-droppings that is guaranteed to work in all cases?
The problem is not actually to find the critical floor, but merely to decide floors from which eggs should be dropped so that the total number of trials are minimized.
 

Problem approach

Tip 1 : Practice 15-20 puzzles from codezen and GFG

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
Software Development
2 rounds | 6 problems
Interviewed by Algo8
762 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
1633 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
1101 views
0 comments
0 upvotes
company logo
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
879 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Product Intern
2 rounds | 8 problems
Interviewed by Adobe
1837 views
0 comments
0 upvotes
company logo
Product Intern
2 rounds | 4 problems
Interviewed by Adobe
1464 views
0 comments
0 upvotes
company logo
Product Intern
2 rounds | 3 problems
Interviewed by Adobe
1214 views
0 comments
0 upvotes