How nishantdubey-tech/leetcode works
This repository is a LeetCode practice collection: users choose a problem, provide its expected input, and run or submit that problem’s standalone C++ solution to obtain an answer. The files are independent snippets, not stages in a shared application pipeline. The graph groups representative solutions by algorithm domain; edges from the user are dashed because the repository shows no common runner or dispatch mechanism. The README documents a broader topic catalog, and the tree contains many additional standalone solutions not individually shown here.
Main entry points: 0074-search-a-2d-matrix.cpp Array Search · 0056-merge-intervals.cpp Intervals · 0018-4sum.cpp Array Pairing · 0079-word-search.cpp Word Search
Components 18
Arrays & Intervals
- Array Search
0074-search-a-2d-matrix/0074-search-a-2d-matrix.cpp - Intervals
0056-merge-intervals/0056-merge-intervals.cpp - Array Pairing
0018-4sum/0018-4sum.cpp
Strings & Search
- Word Search
0079-word-search/0079-word-search.cpp - Word Ladders
0126-word-ladder-ii/0126-word-ladder-ii.cpp
Tree Algorithms
- BST Operations
0701-insert-into-a-binary-search-tree/0701-insert-into-a-binary-search-tree.cpp - BST Validation
0098-validate-binary-search-tree/0098-validate-binary-search-tree.cpp - BST Recovery
0099-recover-binary-search-tree/0099-recover-binary-search-tree.cpp - BST Iterator
0173-binary-search-tree-iterator/0173-binary-search-tree-iterator.cpp - Tree Codec
0297-serialize-and-deserialize-binary-tree/0297-serialize-and-deserialize-binary-tree.cpp - Tree Distance
0863-all-nodes-distance-k-in-binary-tree/0863-all-nodes-distance-k-in-binary-tree.cpp
Graphs & Grids
- Course Ordering
0210-course-schedule-ii/0210-course-schedule-ii.cpp - Grid Paths
1091-shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.cpp - Graph Connectivity
Dynamic Programming
- Matrix DP
0085-maximal-rectangle/0085-maximal-rectangle.cpp - Sequence DP
1092-shortest-common-supersequence/1092-shortest-common-supersequence.cpp - Path DP
0063-unique-paths-ii/0063-unique-paths-ii.cpp
Other components
- Problem Solver
Connections 17
- Problem Solver → Array Search: chooses problem
- Problem Solver → Intervals: chooses problem
- Problem Solver → Array Pairing: chooses problem
- Problem Solver → Word Search: chooses problem
- Problem Solver → Word Ladders: chooses problem
- Problem Solver → BST Operations: chooses problem
- Problem Solver → BST Validation: chooses problem
- Problem Solver → BST Recovery: chooses problem
- Problem Solver → BST Iterator: chooses problem
- Problem Solver → Tree Codec: chooses problem
- Problem Solver → Tree Distance: chooses problem
- Problem Solver → Course Ordering: chooses problem
- Problem Solver → Grid Paths: chooses problem
- Problem Solver → Graph Connectivity: chooses problem
- Problem Solver → Matrix DP: chooses problem
- Problem Solver → Sequence DP: chooses problem
- Problem Solver → Path DP: chooses problem