Tip 1 : Prepare for classic HR questions, can help prepare for most situational questions you may expect.
Tip 2 : Ask relevant questions to interviewers at the end of every interview.
Tip 1 : Keep it clean.
Tip 2 : Put some projects on it.
You are given ‘str’ = ‘abbbbbbc’ and ‘K’ = 2, then the substrings that can be formed are [‘abbbbbb’, ‘bbbbbbc’]. Hence the answer is 7.
A simple solution would be to generate all substrings of the given string and return the longest substring containing k distinct characters.
What are 2-D Matrix, Prefix Sum, Binary Search ?
What is Priority Queue, Binary Search on Answer ?
What is Simulation, Greedy, BFS ?
Design a data structure to store the strings' count with the ability to return the strings with minimum and maximum counts.
Struggled to come up with an O(1) soln, optimised upto O(log(n)), got a hint that helped me with the thought process to optimise all operations to O(1).
Projects + CS Core + HR questions
Tip 1: Focus on the fundamentals of DSA and a strong understanding of the internal workings of the same.
Tip 2: Keep interacting throughout the interview. Think out loud and explain everything.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which array operation has O(n) worst-case time complexity?