This is the implementation of 2nd Part in 3-Part Series of Algorithms Illuminated Book. All Implementations in this repository are written in both Python and Golang. Single IPython Notebook contains all Algorithms given in this Part 2.

python golang dfs heap dijkstra bfs topological-sort breadth-first-search depth-first-search dijkstra-algorithm search-trees connected-components graph-representation strongly-connected-components heap-sort coursera-algorithms-specialization median-maintenance algorithms-illuminated two-sum-problem ajacency-list

• Updated Apr 7, 2021
• Jupyter Notebook

Developed a linear-time Python optimization utility that leverages dictionary lookups to resolve strict-budget Azure resource constraints.

python algorithms leetcode-python two-sum azure-cloud two-sum-problem

• Updated Aug 13, 2026
• Python

The repository 'leet-code' offers solutions to various LeetCode problems, including an optimized algorithm. The project features well-documented code, unit tests for validation, and supports Python 3.6 or higher. Users can clone the repository to explore and utilize the solutions.

leetcode collections leetcode-solutions combinations roman-numerals binary-search unittesting leetcode-python algorithms-and-data-structures punishments permutations-and-combinations two-sum-problem leetcode-solutions-python rotated-sorted-array roman-to-integer merge-two-sorted-arrays punishment-number-problem combination-sum sorted-linked-list max-vowels

• Updated Apr 12, 2025
• Python

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.

javascript algorithms leetcode data-structures interview-preparation coding-interview two-sum leetcode-solution two-sum-problem

• Updated Jan 28, 2024
• JavaScript