Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Duplicates in an array in O(n) time and by using O(1) extra space | Set-3
- Duplicates in an array in O(n) and by using O(1) extra space | Set-2
- Find the maximum repeating number in O(n) time and O(1) extra space
- Rearrange positive and negative numbers in O(n) time and O(1) extra space
- Design a stack that supports getMin() in O(1) time and O(1) extra space
- Count frequencies of all elements in array in O(1) extra space and O(n) time
- Rearrange array in alternating positive & negative items with O(1) extra space | Set 2
- Rearrange an array in maximum minimum form | Set 2 (O(1) extra space)
- Rearrange array in alternating positive & negative items with O(1) extra space | Set 1
- Find duplicates in constant array with elements 0 to N-1 in O(1) space
- Efficiently merging two sorted arrays with O(1) extra space and O(NlogN + MlogM)
- Move all negative numbers to beginning and positive to end with constant extra space
- Connect nodes at same level using constant extra space
- K'th smallest element in BST using O(1) Extra Space
- Rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space
- Merge two sorted arrays with O(1) extra space
- Move all negative elements to end in order with extra space allowed
- Shuffle 2n integers in format {a1, b1, a2, b2, a3, b3, ......, an, bn} without using extra space
- k smallest elements in same order using O(1) extra space
- Shuffle 2n integers as a1-b1-a2-b2-a3-b3-..bn without using extra space
