Product Intern
2 rounds | 4 Coding problems
603 views
Interview preparation journey
Preparation
Duration: 2 months
Topics: Data Structures - Arrays, Strings, Stacks, Queues, Recursion, Hashmaps, Trees, Pointers,Dynamic Programming, Operating Systems - OS Kernel, Deadlock, Virtual Memory, Memory Management, Paging, Segmentation, Object Oriented Programming, Puzzles
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 criteria
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
Medium
Online Coding Interview
Duration60 minutes
Interview date22 Nov 2018
Problems1
Colourful Knapsack Problem

#### 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'...

view more
02
Round
Easy
Telephonic
Duration60 mins
Interview date5 Dec 2018
Problems3
There are two singly linked lists in a system. By some programming error, the end node of one of the linked list got linked to the second list, forming an inverted Y shaped list. Write a program to get the point where two linked list merge.

#### Your task is to find the data of the node at which merging starts. If ...

view more
Problem approach

Simple approach - Use 2 nested loops. The outer loop will be for each node of the 1st list and inner loop will be for 2nd list.
Optimised Approach -
Get count of the nodes in the first list, let count be c1.
Get count of the nodes in the second list, let count be c2.
Get the difference of counts d = abs(c1 – c2)
Now traverse the bigger list from the first node till d nodes so tha...

view more
Asked concepts like - Segmentation, Swapping using Virtual Memory, Kernel .
Problem approach

Tip 2:Try to give real life examples after explaining the concepts.

Egg dropping puzzle

It was just discussed at the end.

Problem approach

Tip: Practice 15-20 puzzles from codezen and GFG

Similar interview experiences
SDE - 2
4 rounds | 9 problems
241 views
MTS-2
3 rounds | 5 problems
383 views
SDE - 1
3 rounds | 6 problems
27 views
Associate Consultant
3 rounds | 4 problems
17 views
Companies with similar interview experiencs
Product Intern
2 rounds | 2 problems
Interviewed by Inncircles Technologies
532 views