********** Main **********

Brute Force approach for Container with Most Water

* Brute Force approach for Container with Most Water * @param {number[]} height - Array of heights * @return {number} - Maximum water that c

Two Pointers approach for Container with Most Water

* Two Pointers approach for Container with Most Water * @param {number[]} height - Array of heights * @return {number} - Maximum water that

LeetCode 876 - Middle of the Linked List (Counting Approach)

LeetCode 876 - Middle of the Linked List (Fast and Slow Pointer Approach)

Move Zeroes using Two Pointers

* Move Zeroes using Two Pointers * @param {number[]} nums - Input array