Hike Interview Experience | Off Campus - Jan 2022

New update is available. Click here to update.

SDE - 1

Hike

2 rounds | 3 Coding problems

Anonymous

Fresher | Jan 2022

Rejected

367 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Graph should be on your tips.
Tip 2 : while explaining the solution to interviewer, dont just hop onto the most optimal solution. Start with the brute force one, give the cons of brute force solution, and then go step by step till you reach the optimal solution.
Tip 3 : Improve on your communication skills as well.

Application process

Where: Other

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Mention only what is required for your profile, for e.g. do not stress too much on your co curricular stuff. Rather, try explaining more of your technical stuff that is relevant for your job.
Tip 2 : Keep it limited to 1 page. And make sure its a pdf and not an image.

Interview rounds

Round

Easy

Video Call

Duration45 minutes

Interview date28 Jan 2022

Problems2

Validate BST

You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.

Problem approach

Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.

Try solving now

Longest Palindromic Subsequence

You have been given a string ‘A’ consisting of lower case English letters. Your task is to find the length of the longest palindromic subsequence in ‘A’.

Problem approach

You have been given a string ‘A’ consisting of lower case English letters. Your task is to find the length of the longest palindromic subsequence in ‘A’.
A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters. (i.e. “ace” is a subsequence of “abcde” while “aec” is not).
A string i...

Try solving now

Round

Easy

Video Call

Duration45 minutes

Interview date28 Jan 2022

Problems1

Word Wrap

You are given ‘N’ words of ...

Problem approach

You are given ‘N’ words of various lengths, now you have to arrange these words in such a way that each line contains at most ‘M’ characters and each word is separated by a space character. The cost of each line is equal to the cube of extra space characters required to complete ‘M’ characters in that particular line. Total cost is equal to the sum of costs of each line.

Try solving now