'Coding has over 700 languages', '67% of programming jobs aren’t in the
technology industry', 'Coding is behind almost everything that is powered
by electricity'

Problem of the day

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

SDE - Intern

Hike

1 rounds | 4 Coding
problems

Interview preparation journey

Preparation

Duration: 2 months

Topics: Data Structure,OOPS, Java, Graphs, Pointers

Tip

Tip 1 : Do at least 1 project.

Tip 2 : Practice data structure questions.

Tip 3 : Dynamic programming is must.

Application process

Where: Campus

Eligibility: Above 8 CGPA

Resume tip

Tip 1 : Do not put false things.

Tip 2 : Keep it short and direct.

Interview rounds

01

Round

Medium

Online Coding Interview

Duration90 minutes

Interview date12 Feb 2021

Coding problem4

Timing was 10AM. The platform was quite good.

1. Maximum size rectangle sub-matrix with all 1's

View more

Problem approach

If the height of bars of the histogram is given then the largest area of the histogram can be found. This way in each row, the largest area of bars of the histogram can be found. To get the largest rectangle full of 1’s, update the next row with the previous row and find the largest area under the histogram, i.e. consider each 1’s as filled squares and 0’s with an empty square and consider each...

View more

2. Maximum Sum path of a binary tree.

View more

Problem approach

For each node there can be four ways that the max path goes through the node:

1. Node only

2. Max path through Left Child + Node

3. Max path through Right Child + Node

4. Max path through Left Child + Node + Max path through Right Child

3. Minimum number of swaps required to sort an array

View more

Problem approach

This can be easily done by visualizing the problem as a graph. We will have n nodes and an edge directed from node i to node j if the element at i’th index must be present at j’th index in the sorted array.

4. Prefix to Infix

View more

Problem approach

Algorithm for Prefix to Infix:

Read the Prefix expression in reverse order (from right to left)

If the symbol is an operand, then push it onto the Stack

If the symbol is an operator, then pop two operands from the Stack

Create a string by concatenating the two operands and the operator between them.

string = (operand1 + operator + operand2)

And push the resultant string ba...

View more

Start a Discussion

Similar interview experiences

SDE - Intern

2 rounds | 2 problems

Interviewed by Hike

413 views

0 comments

0 upvotes

SDE - Intern

1 rounds | 4 problems

Interviewed by Hike

485 views

0 comments

0 upvotes

SDE - Intern

1 rounds | 4 problems

Interviewed by Hike

481 views

0 comments

0 upvotes

SDE - Intern

4 rounds | 7 problems

Interviewed by Hike

702 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - Intern

3 rounds | 6 problems

Interviewed by Amazon

10806 views

4 comments

0 upvotes

SDE - Intern

4 rounds | 7 problems

Interviewed by Microsoft

9347 views

1 comments

0 upvotes

SDE - Intern

2 rounds | 4 problems

Interviewed by Amazon

7263 views

2 comments

0 upvotes