Tip 1 : Practice at least 250 - 300 Questions from online platforms
Tip 2 : Be consistent in giving contest.
Tip 3 : Practice mock interviews with your friends.
Tip 4 : Mention at least 2 good projects in your resume.
Tip 1 : Follow some standard resume format and add 2-3 projects with explanations in point, also include technologies used in the project.
Tip 2 : Add your achievements in the resume in points.
Tip 3 : Make sure you add all the technologies you are aware of in your resume and also, add links to competitive profiles (if you have good coding profiles).
Contest was scheduled for 6PM and test link was provided to every eligible candidate.



Step 1 : Find the greater_left array. greater_left[i] represents the number of elements greater than a[i] and in left side of it ( from 0 to i-1 ).
Step 2 : Find the smaller_right array. smaller_right[i] represents the number of elements smaller than a[i] and in right side to it ( from i+1 to n-1 )
Step 3: The final answer will be the sum of the product of greater_left[i] and smaller_right[i] for every index.


You don’t have to print anything, it has already been taken care of. Just complete the function.
If there is no common subsequence, return 0.
This problem is similar to fining LCS of two strings.
The idea is to take a 3D array to store the
length of common subsequence in all 3 given
sequences i.e., L[m + 1][n + 1][o + 1].
Interview started at 11 AM on Hackerrank platform



‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’.
‘ARR1’ = [3 4 6 9 10]
This problem was similar to merging two array with condition that we can to merge in decreasing order.
Tip 1 : Read about OOPS and OS concepts thoroughly.
Tip 2 : Read topic wise articles from internet
Dining Philosopher problem using Semaphore, mutex lock with pseudo code.
Tip 1: Read and practice OS concepts.



[2,3,4] - median is 3.
[2,3] - median is floor((2+3)/2) = 2.
The problem has a solution using priority queue.
The interview started at 7 PM and the interviewer were helpful.
Design data structure to implement a text editor. I was made to code following operations ( they often asked to write in the most readable and optimal way )
Insertion at any location
Deletion of word from any location
Undo
Redo
Copy/Paste
Tip 1 : Practice such problems from online platforms
Tip 2 : Also understand the internal working of different standard DS.
int arr[2];
while(true)
arr++;
Tip 1 : Read OOPS and OS concepts from internet thoroughly.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?