DSA
5 approaches incl. Brute Force, Better, II, and more. Optimal — Time O(n), Space O(1).
Covers: brute Force, Dynamic Programming. Optimal — Time O(n), Space O(n).
Covers: Brute Force, Bit Manipulation. Optimal — Time O(1), Space O(1).
Bit Manipulation. Time O(1), Space O(1).
Covers: Shift Right and Count, Brian Kernighan's Algo. Optimal — Time O(t), Space O(1).
DP approach.