LeetCode / Source notebook
LeetCode & algorithm practice A source-linked inventory of Python exercises: inspect the modules, topics and definition sites without running their code.
Back to LeetCode
Mental map
Python modules
4
Files indexed statically.
Top-level functions
50
Includes async and repeated definitions.
Classes
12
Immediate top-level class definitions.
Direct methods
40
Includes constructors, not nested routines.
Routine definitions
90
Functions + direct methods; NOT problems solved.
arrays_and_strings Array and string practice, including consecutive-one scanning.
arrays_and_strings.py
arrays strings linear scans 1 top-level functions · 0 classes · 0 direct methods.
Browse indexed symbols in arrays_and_strings
Top-level functions
Classes & direct methods No top-level classes indexed.
biggest_prime Primality testing and number-theory practice.
biggest_prime.py
Number-theory exercise: biggest_prime is primality practice, not necessarily a LeetCode submission.
1 top-level functions · 0 classes · 0 direct methods.
Browse indexed symbols in biggest_prime
Top-level functions
Classes & direct methods No top-level classes indexed.
hash_tables Hash-table implementations and dictionary/set-based algorithm practice.
hash_tables.py
hash tables dictionaries sets counting lookup 22 top-level functions · 8 classes · 30 direct methods.
Browse indexed symbols in hash_tables
Top-level functions
Classes & direct methods __init__ direct method · source line 17 add direct method · source line 20 remove direct method · source line 24 contains direct method · source line 29 MyHashSet · class at source line 34eval_hash direct method · source line 52 __init__ direct method · source line 55 add direct method · source line 58 remove direct method · source line 63 contains direct method · source line 68 __init__ direct method · source line 76 put direct method · source line 79 get direct method · source line 82 remove direct method · source line 87 Bucket · class at source line 93__init__ direct method · source line 94 get direct method · source line 97 update direct method · source line 103 remove direct method · source line 114 MyHashMap · class at source line 119__init__ direct method · source line 121 put direct method · source line 126 get direct method · source line 131 remove direct method · source line 136 TwoSum · class at source line 901__init__ direct method · source line 903 add direct method · source line 906 find direct method · source line 909
trees_and_tries Binary-tree traversal and binary-search-tree practice; the filename also names tries.
trees_and_tries.py
binary trees binary search trees breadth-first search depth-first search 26 top-level functions · 4 classes · 10 direct methods.
Browse indexed symbols in trees_and_tries
Top-level functions
Classes & direct methods BSTIterator · class at source line 602__init__ direct method · source line 604 inorder direct method · source line 609 next direct method · source line 616 hasNext direct method · source line 620 KthLargest · class at source line 786__init__ direct method · source line 788 add direct method · source line 794 insert direct method · source line 798 searchKth direct method · source line 808 No matching modules. Try a shorter module, topic or symbol name.
All modules and collapsible symbol lists work without JavaScript. Use your browser's Find command to search.
What this index does—and does not—count
AST only: immediate top-level functions and direct methods of top-level classes, including async/repeated definitions and constructors. Excludes nested/control-flow definitions and lambdas; routineCount is definition sites, not unique problems solved. Curated filename topics are descriptive, not proof of implementations. Local working tree may differ from linked HEAD commit; no imports, execution or snapshot fallback.
No completion, correctness, acceptance, difficulty or solved-problem totals are inferred from these definitions. No full source code is reproduced here.
Source repository · Revision:
f9cf5a8eb0dd2c118e29af40d77f03be5b1cb7d2.
The input is the local working tree. A recorded HEAD commit is provenance, not
proof of a clean checkout; linked source may differ from the analyzed text.