How rathorchanchal1/leetcode_solutions works
This repository is a collection of independent Java solutions to coding problems, not a shared application: a caller supplies problem inputs to an individual solution method and receives its result. The solutions cover arrays, searching, strings, and dynamic programming. The sampled 3Sum implementation calls its own twoSum helper; no other cross-solution calls or shared runtime are evidenced. README content is empty, so the map reflects the source index and sampled implementations rather than documented product capabilities.
Main entry points: Solution.java 3Sum
Components 15
Easy Solutions
- Two Sum
Easy/1-two-sum/Solution.java - Valid Palindrome
Easy/125-valid-palindrome/Solution.java - Contains Duplicate
Easy/217-contains-duplicate/Solution.java - Palindrome Number
Easy/9-palindrome-number/Solution.java
Array Techniques
- Container Water
Medium/11-container-with-most-water/Solution.java - 3Sum
Medium/15-3sum/Solution.java - Two Sum Helper
Medium/15-3sum/Solution.java - Product Except Self
Medium/238-product-of-array-except-self/Solution.java - Top K Frequent
Medium/347-top-k-frequent-elements/Solution.java - Maximum Subarray
Medium/53-maximum-subarray/Solution.java
Search Problems
- Find Minimum
Medium/153-find-minimum-in-rotated-sorted-array/Solution.java - Rotated Search
Medium/33-search-in-rotated-sorted-array/Solution.java
Strings And DP
- Longest Substring
Medium/3-longest-substring-without-repeating-characters/Solution.java - Interleaving String
Medium/97-interleaving-string/Solution.java
Other components
- Solution caller
Connections 1
- 3Sum → Two Sum Helper: calls
Medium/15-3sum/Solution.java