QuestionBankRevisit

This Repo will be to store important or interesting CP questions with unique optimisation methods I have come across. I will Begin curating it once it hits the 100 # Mark.

  1. Rearrange a given array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space.
  2. Count # of trailing zeroes in a factorial!
  3. one element in the array is missing and another one is repeated for array size n and numbers range(1,n). Find sol in O(n) time and O(1) auxilary space without modifying array
  4. Find duplicate integer in array in O(1) space and O(n) time . (2 methods)