How anand123-a/leetcode works
This repository is a collection of independent LeetCode solutions, not a shared application. Each solution exposes a problem-specific method that computes an answer; there is no documented runtime entry point connecting the solutions. The README lists six solved problems. The graph includes all eight solution files shown in the source index, including alternate-language implementations.
Components 8
Other components
- Two Sum Java
1-two-sum/solution.java - Two Sum Python
1-two-sum/solution.py - Majority Element
169-majority-element/solution.py - Hamming Weight C
191-number-of-1-bits/solution.c - Hamming Weight Python
191-number-of-1-bits/solution.py - Employee Target Count
2798-number-of-employees-who-met-the-target/solution.py - Median of Arrays
4-median-of-two-sorted-arrays/solution.py - Lemonade Change
860-lemonade-change/solution.py