Problem of the day
Tip 1 : Data structures and Algorithms foundation is a must, all technology and knowledge is just kind of a bummer if DSA is weak. Naive approaches must be clean and clear by everyone. At least complete all easy level questions on leetcode.
Tip 2 : Most of the good companies are basically fond of your mental and technical skills and data structure knowledge. Doesn't matter how bad the complexity you make at the first attempt but you should have at least the way out to solve that problem and then start to think to improve the solution.
Tip 3 : Soft skills are kind of important but not to that extent that it can hide your loopholes in foundation knowledge. Even some personal project is more than enough to balance your presentation.
Tip 1: Short and clear. 2 pages are maximum.
Tip 2: Project should have links to your github instead of just sentences.
First-round was the machine test coding round on HackerEarth with a decent level of questions on data structures and algorithms. It consists of 3 questions 2 medium and 1 easy to moderate in 60 minutes.
I went for the naive approaches in all questions. Finding all substrings and getting the longest palindrome using backtracking it would be O(n^3) but it can be improved using dynamic programming but I approached a better solution which is expanding the string from the middle the complexity would be O(n^2)
Stack is the most famous approach for this question.
The naive approach by checking the number and all its terms in one iteration is a good enough solution.
Video call round to test my real-time data structures and algorithms skills. Good with core subjects like Operating systems, DBMS, and computer networks. Never let them know your weaker side and loopholes.