function binarySearch(nums: number[], target: number): number {
    let left = 0;
    let right = nums.length - 1;

    while (left <= right) {
        const mid = left + Math.floor((right - left) / 2);

        if (nums[mid] === target) {
            return mid;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return left;
}

function searchInsert(nums: number[], target: number): number {
    return binarySearch(nums, target);
};

https://ui.shadcn.com/create?base=base&template=vite&baseColor=stone&theme=blue&item=pagination-example

function twoSum(nums: number[], target: number): number[] {
    const map = new Map();
    for(let i = 0; i < nums.length; i++) {
        if(map.has(target - nums[i])) {
            return [map.get(target - nums[i]), i];
        } else {
            map.set(nums[i], i);
        }
    }
    return []
}

console.log(twoSum([1, 2, 3, 4, 5], 3))

function removeDuplicates(nums: number[]): number {
    nums.splice(0, nums.length, ...Array.from(new Set(nums)));
    return nums.length;
};

console.log(removeDuplicates([1, 2, 3, 4, 5, 6]))

function removeElement(nums: number[], val: number): number {
    let zeroStartIndex = 0;
    for(let i = 0; i < nums.length; i++) {
        if(nums[i] !== val) {
            nums[zeroStartIndex] = nums[i];
            zeroStartIndex++;
        }
    }
    return zeroStartIndex;
};

// Print Hello, World!
console.log("Hello, World!");