This repository contains solved programming problems for building the skills of competitive programming.
Sort an array of 0’s 1’s 2’s without using extra space or sorting algorithm.
Given an sorted array of size n. Array elements are in the range from 1 to n. One number from the set {1,2,...,n} is missing and one occurs twice in the array. Find these two numbers.
Solve problem 2 with a same but "unsorted" array.