Tip 1 : Do at least two projects
Tip 2 : Be regular in giving competitive programming contests
Tip 3 : Be your resume
Tip 1 : Be your resume
Tip 2 : Have some achievements in competitive programming and at least 2 projects
The key point is to observe the answer. If we have B swaps, what does the starting of the permutation look like?
The permutation starts with N for sure and continues with (n-1), (n-2), …, (n-B+1).
Use greedy approach to make the largest lexicographical value array.
There are 25 horses, and 5 race tracks, find minimum number of races required to find the top 3 fastest horses.
Tip 1 : Solve more puzzles
Tip 2 : Use pen and paper and put variable names efficiently