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

# SDE - 1

1 rounds | 3 Coding problems

## Interview preparation journey

Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

## Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date26 May 2015
Coding problem3

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

### 1. Count Ways To Reach The N-th Stairs

Moderate
30m average time
80% success
0/80

#### Each time, you can climb either one step or two steps.

View more
Problem approach

The question can be approached using recursion. The person can reach nth stair from either (n-1)th stair or from (n-2)th stair. Hence, for each stair n, find out the number of ways to reach n-1th stair and n-2th stair and add them to give the answer for the nth stair. Therefore the expression for such an approach comes out to be : ways(n) = ways(n-1) + ways(n-2)

This is an expression for...

View more

### 2. Optimal Strategy for a Game

Easy
15m average time
85% success
0/40

#### The rule of the game is as follows:

View more
Problem approach

Using recursion: Suppose it's your turn and you are left with coins in the index range ['I', â€˜Jâ€™]. You have the option to pick either ith or jth coin. Of these two options, you would select the one which maximizes your winning amount.
o If you pick the ith coin. The other player will have the option to pick ('I'+1)th or â€˜Jâ€™th coin.
â†’ If the other player picks the ('I'+1)th coin. You can p...

View more

### 3. Generate all parenthesis

Moderate
30m average time
85% success
0/80

#### You are given an integer 'N', your task is to generate all combinations of well-formed parenthesis having â€˜Nâ€™ pairs.

View more
Problem approach

The question can be solved using a backtracking approach. Use two integers to count the remaining left parenthesis (n) and the right parenthesis (m) to be added. At each function call add a left parenthesis if n >0 and add a right parenthesis if m>n. Append the result and terminate recursive calls when both m and n are zero.
Steps :
1. Create a backtrack function that updates the cu...

View more

Here's your problem of the day

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

What is the return type of a method that doesn't return any value?

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 5 problems
723 views
SDE - 1
3 rounds | 9 problems
760 views
SDE - 1
2 rounds | 4 problems
735 views
SDE - 1
2 rounds | 4 problems
685 views
Companies with similar interview experiences
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views