Writing this project for reference, fun and learning purposes. Have started with simple algorithms, will try to cover more as we go on this journey

LeetCode Javascript

Given an array of Integers nums and an integer target, return indicies of two numbers such that they add up to target

A highly efficient Python implementation of the 'Two Sum' problem using a Hash Map (Dictionary). Unlike the Brute Force approach, this script solves the problem in a single pass ($O(n)$) by storing visited numbers and checking for their complement instantly.

This week is about evidence. I created a Python script to simulate and visualize the performance difference between a Brute Force approach ($O(n^2)$) and an **Optimized Hash Map** approach ($O(n)$) for the Two Sum problem.

Two Sum in every language