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

# Software Developer

3 rounds | 6 Coding problems

## Interview preparation journey

Preparation
Duration: 5 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 date21 May 2015
Coding problem3

This was a 1 hour online coding round on hackerrank platform. 3 DSA questions were given.

### 1. Selling Stock

Moderate
22m average time
0/80

#### You have been given stock values/prices for N number of days. Every i-th day signifies the price of a stock on that day. Your task is to find the maximum profit which you can make...

View more
Problem approach

A max heap can be used here. In order to maximize the profit, the ticket must be for the seat in a row which has the maximum number of vacant seats and the number of vacant seats in that row will be decremented by 1 as one of the seats has just been sold. All the persons can be sold a seat ticket until there are vacant seats.

### 2. NINJA'S COMPLEMENT

Easy
20m average time
80% success
0/40

#### Everyday ninja sees a number in his dream but he doesnâ€™t real...

View more
Problem approach

To find bâ€™s complement: To find bâ€™s complement, add 1 to the calculated (b-1)â€™s complement.
Steps to find (b-1)â€™s complement:
To find (b-1)â€™s complement, Subtract each digit of the number from the largest number in the number system with base b .
For example, if the number is a three-digit number in base 9, then subtract the number from 888 as 8 is the largest number in base 9 nu...

View more

### 3. Check N numbers

Moderate
10m average time
90% success
0/80

#### Given an array â€˜arrâ€™ of â€˜Nâ€™ integers, make a number from those set of all integers from the â€˜arrâ€™ such that if number of â€˜ithâ€™...

View more
02
Round
Easy
Video Call
Duration60 minutes
Interview date25 May 2015
Coding problem2

In this round, a DSA question was first asked. Then a lot of discussion regarding the various test cases around this question took place. (e.g, handing of -ve numbers , decimals , overflow etc).
Main concentration was just to get as many as test cases possible and an efficient solution as well.
And Some common question like why you coding in C++?

### 1. Sum of Digits

Easy
15m average time
85% success
0/40

#### Ninja is given an integer â€˜Nâ€™. One day Ninja decides to do the sum of all digits and replace the â€˜Nâ€™ with the sum of digits until it becomes less than 10. Ninja wan...

View more
Problem approach

Scan each character of the input string and if a number is formed by consecutive characters of the string, we increment the result by that amount.
Time Complexity : O(n)

### 2. OOPS Question

What are the advantages of OOPS?

Problem approach

OOP language allows to break the program into the bit-sized problems that can be solved easily (one object at a time).
The new technology promises greater programmer productivity, better quality of software and lesser maintenance cost.
OOP systems can be easily upgraded from small to large systems.
It is possible that multiple instances of objects co-exist without any interference,
...

View more
03
Round
Easy
Video Call
Duration60 minutes
Interview date25 May 2015
Coding problem1

Again one coding question to be done on shared screen

### 1. Number Of Triangles In Directed And Undirected Graphs

Moderate
30m average time
70% success
0/80

#### Ninja has been given two Graphs: a directed graph â€˜DIRGRAPHâ€™ and an undirected graph â€˜UNDIRGRAPHâ€™. Ninja has to count the number of triangles in each of the graphs.

View more
Problem approach

The naÃ¯ve approach is to run three loops and keep track of the number of triangles possible so far. The three loops select three different values from array, the innermost loop checks for the triangle property ( the sum of any two sides must be greater than the value of third side).
Time Complexity: O(N^3) where N is the size of input array.

The efficient approach is based on the foll...

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
Software Developer
3 rounds | 10 problems
765 views
SDE - Intern
2 rounds | 5 problems
0 views
SDE - 1
2 rounds | 4 problems
685 views
SDE - Intern
2 rounds | 6 problems
735 views
Companies with similar interview experiences
Software Developer
3 rounds | 8 problems
Interviewed by Tata Consultancy Services (TCS)
0 views