Welcome to Cornell FinTech Club’s NME LeetCode practice repo!
In this repo, we’ll walk through essential coding interview problems to build your data structures & algorithm fundamentals — starting with the most foundational topic:
Topic 1: Arrays & Hashing
We’ll cover beginner-friendly LeetCode problems such as: • Contains Duplicate • Two Sum • Valid Anagram • Group Anagrams
Each problem includes: • A clean function skeleton • Sample test cases • Both Python and Java implementations
⸻
How to Run the Code
Python
-
Make sure Python is installed:
python --version
-
Open any .py file (e.g. solution.py) and run:
python solution.py
⸻
Java
Each Java file is organized in a folder that matches its package name (e.g. contains_duplicates/Solution.java).
- Navigate to the parent directory of the package:
cd path/to/project
- Compile the file:
javac package_name/Solution.java
- Run the file:
java package_name.Solution
Example:
javac contains_duplicates/Solution.java java contains_duplicates.Solution
⸻
What’s Next?
Once you’re comfortable with arrays & hashing, we’ll move on to: • Two pointers • Sliding window • Stack/Queue • Binary Search • Graphs • Recursion & Backtracking