How vikukarthik/preparation works
This repository is a code-preparation collection of standalone LeetCode solutions, not a single application. The principal workflow is to select a problem topic, provide its input to a solution, and obtain an algorithmic result; the sampled files demonstrate individual solutions and examples, not a shared runtime or cross-module orchestration. Nodes therefore represent topic collections, with dedicated nodes for the two SOURCE INDEX core modules. The README is minimal, and unsampled solutions are represented only at their supported directory level.
Components 19
Arrays and Strings
- Array Hash
leetcode/1_array_hash - Two Pointers
leetcode/2_two_pointer - Sliding Window
leetcode/3_sliding_window - String Permutation
leetcode/3_sliding_window/4_permutation_in_string.rb - Math Geometry
leetcode/15_math_geo - Bit Manipulation
leetcode/16_bit_manipulation - Standalone Problems
leetcode
Data Structures
- Stack
leetcode/4_stack - Linked Lists
leetcode/6_linked_list - Trees
leetcode/7_trees - Tries
leetcode/8_tries - Heaps
leetcode/9_heap
Search and Traversal
- Binary Search
leetcode/5_binary_Search - Word Search II
leetcode/8_tries/3_word_search.rb - Backtracking
leetcode/10_backtracking - Graph Algorithms
leetcode/11_graph
Optimization
- Advanced Graphs
leetcode/12_advanced_graph - Greedy Algorithms
leetcode/13_greedy - Intervals
leetcode/14_intervals