SDE - 1
Hike
2 rounds | 3 Coding problems
367 views
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
01
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.

view more
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.

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ā.

view more
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...

view more
02
Round
Easy
Video Call
Duration45 minutes
Interview date28 Jan 2022
Problems1
Word Wrap

#### You are given āNā words of ...

view more
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.

Start a Discussion
Similar interview experiences
SDE - 1
2 rounds | 4 problems
Interviewed by Hike
234 views
SDE - 1
5 rounds | 8 problems
Interviewed by Hike
512 views
SDE - 1
2 rounds | 6 problems
Interviewed by Hike
245 views
SDE - 1
3 rounds | 9 problems
Interviewed by Hike
115 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
83898 views