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;
};

interface Task {
  id: number;
  title: string;
  completed: boolean;
}

class TaskManager {
  private tasks: Task[] = [];

  constructor() {}

  addTask(title: string) {
    const taskId = this.tasks.length + 1;
    const task: Task = {
      id: taskId,
      title,
      completed: false,
    };
    this.tasks.push(task);
  }

  markTaskAsComplete(taskId: number) {
    const task = this.tasks.find((task) => task.id === taskId);
    if (task) {
      task.completed = true;
    }
  }

  markTaskAsIncomplete(taskId: number) {
    const task = this.tasks.find((task) => task.id === taskId);
    if (task) {
      task.completed = false;
    }
  }

  listTasks() {
    console.log('Tasks:');
    this.tasks.forEach((task) => {
      console.log(`${task.id}. [${task.completed ? 'X' : ' '}] ${task.title}`);
    });
  }
}

// Example usage:
const taskManager = new TaskManager();
taskManager.addTask('Buy groceries');
taskManager.addTask('Pay bills');
taskManager.addTask('Clean the house');
taskManager.listTasks();

// Output:
// Tasks:
// 1. [ ] Buy groceries
// 2. [ ] Pay bills
// 3. [ ] Clean the house

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))

class DFS
{
   public dfs(G: DFSGraph, startVert: number)
   {
       let visited: boolean[] = Array<boolean>();
       // Pre-populate array:
       for(let i = 0; i < G.size; i++)
       {
           visited.push(false);
       }

       let s: number[] = new Array();

       visited[startVert] = true;

       s.push(startVert);

       while(s.length > 0)
       {
           const v = s.pop();
           for(let adjV of G.adj[v])
           {
               if(!visited[adjV])
               {
                   visited[adjV] = true;
                   s.push(adjV);
               }
           }
       }
   }

   public dfsRecursive(G: DFSGraph, startVert: number)
   {
       let visited: boolean[] = Array<boolean>();
       // Pre-populate array:
       for(let i = 0; i < G.size; i++)
       {
           visited.push(false);
       }
       this.dfsAux(G, startVert, visited);
   }

   private dfsAux(G: DFSGraph, v: number, visited: boolean[])
   {
       visited[v] = true;
       for(let adjV of G.adj[v])
       {
           if(!visited[adjV])
           {
               // this.foo(); // Something can happen before the visit.
               this.dfsAux(G, adjV, visited);
               // this.bar(); // Something can happen after the visit.
           }
       }
   }
}

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);
};