Loading repository data…
Loading repository data…
Zanger67 / repository
My 500+ LeetCode solutions in Python, Java, C, and others from my journey -- grouped by topics, lists, dailies, recent, etc.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
My LeetCode Profile: Zanger
This repo is a collection of my LeetCode solutions, primarily written in Python, Java, and C. On any page, click the main title to be redirected to the official LeetCode page for the question, topic, list, etc. See the Additional Categories section for pages that group questions by different criteria -- e.g. by their related topics.
Array, String, Hash Table, Depth-First Search, Math, Tree, Sorting, Binary Tree, Breadth-First Search, Two Pointers, Dynamic Programming, Matrix, Stack, Greedy, Simulation, Linked List, Binary Search, Design, Counting, Bit Manipulation, Heap (Priority Queue), Backtracking, Prefix Sum, Sliding Window, Trie, Graph Theory, Recursion, Database, Binary Search Tree, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
| # | Title | Level | Cats | Solution | Languages |
|---|---|---|---|---|---|
| 1 | Two Sum | Easy | B75, N150 | solution | java, py |
| 2 | Add Two Numbers | Medium | N150 | solution | java |
| 3 | Longest Substring Without Repeating Characters | Medium | B75, N150 | solution | java |
| 5 | Longest Palindromic Substring | Medium | B75, N150 | solution | py |
| 7 | Reverse Integer | Medium | N150 | solution | py |
| 8 | String to Integer (atoi) | Medium |
| solution |
| py |
| 9 | Palindrome Number | Easy | solution | java |
| 13 | Roman to Integer | Easy | solution | py |
| 14 | Longest Common Prefix | Easy | solution | java |
| 17 | Letter Combinations of a Phone Number | Medium | N150 | solution | java |
| 19 | Remove Nth Node From End of List | Medium | B75, N150 | solution | c, java, py |
| 20 | Valid Parentheses | Easy | B75, N150 | solution | java |
| 21 | Merge Two Sorted Lists | Easy | B75, N150 | solution | java |
| 22 | Generate Parentheses | Medium | N150 | solution | py |
| 23 | Merge k Sorted Lists | Hard | B75, N150 | solution | py |
| 24 | Swap Nodes in Pairs | Medium | solution | c |
| 25 | Reverse Nodes in k-Group | Hard | N150 | solution | c |
| 26 | [Remove Duplicates from Sorted Array](<https://leetcode.com/problems/remove-duplica |