1. Given an array . One element is occurring more than n/2 times. Need to find the element.
O(n) solution is expected.
2. Given an linked list. Need to delete m nodes from nth node.
3. Given an array. Need to find 3 elements. Where A[i] < A[j] < A[k] and i < j < k .
both indices and array elements should satisfy the above condition.
O(n) solution is expected.
O(n) solution is expected.
2. Given an linked list. Need to delete m nodes from nth node.
3. Given an array. Need to find 3 elements. Where A[i] < A[j] < A[k] and i < j < k .
both indices and array elements should satisfy the above condition.
O(n) solution is expected.
