Tip 1 : Be consistent. Make a schedule to atleast do 3-5 questions daily no matter how busy the schedule is. This will help to make routine and soon you will start seeing your growth.
Tip 2 : Explore. Keep exploring and have the interest to learn. Web Development is something that more you explore and more you practice, the more you will ace.
Tip 3 : Participate in more events and hackathons. This will add up to your experience and you will network with a lot of people.
Tip 1 : Don't add a long list of projects. Just add 2-3 of your best projects that will define your total knowledge and work you have done. Even 1 major project will define your work but it should be a great one.
Tip 2 : Never lie on your resume. Only add the skills that you believe you have or you will learn and grasp quickly.
Tip 3 : Be specific about your details and do not write long paragraphs to define your experiences.
It was a basic browser test to test our development skills. There were questions whos answers were in the console, localstorage or the results of fetched API. There was no time limit but the one to complete early were shortlisted.
Tip 1 : Have a good knowledge of web browser like console, localstorage etc.
It was a day test conducted on hackerearth. There were few mcqs and 2 coding questions.

Input: 'N' = 3, 'K' = 2
Output: 6
Say we have the colors with the numbers 1 and 0. We can paint the fence with 3 posts with the following different combinations.
110
001
101
100
010
011
It was a face to face round with Senior Software Engineer. The topic of discussion was Data Structures, Reactjs, the projects I've made and basic web development.
I was given array question to solve and my javascript skills were tested.
There was a good discussion over my major projects and the work I've done.



If the given string is: STR = "abcde". You have to print the string "edcba".
Try to solve the problem in O(1) space complexity.
Step 1 : I first applied normal iteration to reverse the string.
Step 2 : Then they updated the question and give a string expression to reverse.
Step 3 : I then converted it to char array and then reversed the individual word. The interviewer was happy with it.



Given array/list can contain duplicate elements.
(arr[i],arr[j]) and (arr[j],arr[i]) are considered same.
Step 1 : I applied O(n^2) approach firstly.
Step 2 : The interviewer asked to optimize but I cannot think at that moment.
It was a face to face interaction with Tech Lead. Most of the discussion was over Javascript and Reactjs to test my indepth knowledge of basics and advance concepts. Also, questions and discussion on arrays, strings, maps, optimization was there.
There were several questions on OOPS, javascript and reactjs.



Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
The following images depict how the deletion has been performed.


Step 1 : I first applied the native approach to iterate and find the previous and next node and the delete the given node.
Step 2 : I was asked to optimize and since I know the optimization so I used the recursive approach.
Step 3 : The interviewer was impressed over this.
There are two jugs each of 4 and 3 liters respectively , without any measuring marks. how many minimum steps are required to have 2 liters of water into the 4 litre jug (the jugs can be filled any number of times with water, and they can be emptied any number of times). Here we need 2 litre water in 4 litre jug (not in any of the two jugs).
Tip 1 : Think of the problem calmly.
Tip 2 : Try to cancel out the possibilities so you can get more close to your solution.
It was an easy round with the HR of the company. We had a normal discussion over my work and future expeditions and student life.
How will you manage your work life in a new city?
How will you handle a critical work load situation if encountered?
Tip 1 : Be optimistic about your answers.
Tip 2 : Try showing confident and forward-looking prespective.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?