Tip 1 : Do solving questions on Codeforces, geeksforgeeks, leetcode regularly
Tip 2 : Make a goal to complete particular set of questions every day.
Tip 3 : Focus on project as per your interest
Tip 1 : Highlights key word in resume
Tip 2 : Resume must be in proper format
Tip 3 : Modify your resume as per role you applying for.
It was at 10 am.



If the given array is [4, 2, 9] then you should print "3 5 6 7 8". As all these elements lie in the range but not present in the array.
Step 1: Array only contain value from 0 to N and index from 0 to N-1.
Step 2: If you sort the array in increasing order then index match its value.
Step 3: Travel the array if index does not match its value then return the index.
Step 4: If traveling loop complete and return statement not execute then return N



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Step 1: Initialize i=0 and j=N-1
Step 2: Run while loop until iStep 3: If S[i] not equal to S[j] return true.
Step 4: On completion the loop return false.
It was at 1 pm at Google meet



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: You can't remove node which you have address, you can do it for next node.
Step 2: Copy the data of next node to current node and point the next of current node to next of next of current node.
Write code using react.js that contain button which give alert by clicking.
Tip 1: Create button using HTML
Tip 2: Button invoked a js function while clicking on button.
Tip 3: Write alert msg to show alert on screen with some message.
It was at 4 pm on Google meet
Describe your react.js mention in resume in detail.
Tip 1: Firstly tell what about overall project.
Tip 2: Divide the project atleast in 4 part and explain each part properly.
You have manual balance machine and given 9 ball, in which all ball's weight are same except the one whose weight less then other. You need to find the ball whose weight are different from other using machine in such a way that number of times using the machine is less.
We apply ternary search operation.
Step 1 : Divide the 9 ball into 3 equal sets
Step 2 : Compare the weight of first two set, if both are equal then that ball found in 3rd set else that ball is in 1st or 2nd set whose weight is less.
Step 3 : Till now we use balance by 1 time and ball reduce to count 3.
Step 4 : Apply step 2 on these 3 ball again.
So, total answer is 2

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