https://github.com/rajput-hemant/leetcode
🏆 Curated solutions to Leetcode problems in multiple languages to ace the Coding Interviews.
https://github.com/rajput-hemant/leetcode
algorithm algorithms coding-interviews data-structures interview-questions leetcode leetcode-cpp leetcode-go leetcode-golang leetcode-java leetcode-python leetcode-rust leetcode-solutions rust rust-lang
Last synced: about 2 months ago
JSON representation
🏆 Curated solutions to Leetcode problems in multiple languages to ace the Coding Interviews.
- Host: GitHub
- URL: https://github.com/rajput-hemant/leetcode
- Owner: rajput-hemant
- License: mit
- Created: 2022-07-31T06:27:12.000Z (almost 3 years ago)
- Default Branch: master
- Last Pushed: 2024-04-11T12:55:28.000Z (about 1 year ago)
- Last Synced: 2025-04-11T04:42:25.916Z (about 2 months ago)
- Topics: algorithm, algorithms, coding-interviews, data-structures, interview-questions, leetcode, leetcode-cpp, leetcode-go, leetcode-golang, leetcode-java, leetcode-python, leetcode-rust, leetcode-solutions, rust, rust-lang
- Language: Java
- Homepage: https://rajput-hemant.github.io/leetcode/
- Size: 13.8 MB
- Stars: 6
- Watchers: 2
- Forks: 1
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
[![][code-quality]][codacy] [![][active-issues]][deepsource] [![][resolved-issues]][deepsource]
![][views] ![][stars] ![][forks] ![][issues] ![][license] ![][code-size] ![][commit-activity]
![Leetcode]()
### 🏆 Curated solutions to Leetcode problems in multiple languages to ace the Coding Interviews.
## Solutions
---
[
**Topic Wise**
][topicwise]
[
**Serial Wise**
][serialwise]
[**_Array_**][array] •
[**_String_**][string] •
[**_Hash Table_**][hash table] •
[**_Dynamic Programming_**][dynamic programming] •
[**_Math_**][math] •
[**_Sorting_**][sorting] •
[**_Greedy_**][greedy] •
[**_DepthFirst Search_**][depth-first search] •
[**_Database_**][database] •
[**_BreadthFirst Search_**][breadth-first search] •
[**_Tree_**][tree] •
[**_Binary Search_**][binary search] •
[**_Matrix_**][matrix] •
[**_Binary Tree_**][binary tree] •
[**_Two Pointers_**][two pointers] •
[**_Bit Manipulation_**][bit manipulation] •
[**_Stack_**][stack] •
[**_Heap (Priority Queue)_**][heap] •
[**_Design_**][design] •
[**_Graph_**][graph] •
[**_Prefix Sum_**][prefix sum] •
[**_Simulation_**][simulation] •
[**_Backtracking_**][backtracking] •
[**_Counting_**][counting] •
[**_Sliding Window_**][sliding window] •
[**_Union Find_**][union find] •
[**_Linked List_**][linked list] •
[**_Ordered Set_**][ordered set] •
[**_Monotonic Stack_**][monotonic stack] •
[**_Enumeration_**][enumeration] •
[**_Recursion_**][recursion] •
[**_Trie_**][trie] •
[**_Divide and Conquer_**][divide and conquer] •
[**_Binary Search Tree_**][binary search tree] •
[**_Bitmask_**][bitmask] •
[**_Queue_**][queue] •
[**_Memoization_**][memoization] •
[**_Topological Sort_**][topological sort] •
[**_Geometry_**][geometry] •
[**_Segment Tree_**][segment tree] •
[**_Hash Function_**][hash function] •
[**_Game Theory_**][game theory] •
[**_Binary Indexed Tree_**][binary indexed tree] •
[**_Number Theory_**][number theory] •
[**_Interactive_**][interactive] •
[**_String Matching_**][string matching] •
[**_Rolling Hash_**][rolling hash] •
[**_Data Stream_**][data stream] •
[**_Shortest Path_**][shortest path] •
[**_Combinatorics_**][combinatorics] •
[**_Randomized_**][randomized] •
[**_Monotonic Queue_**][monotonic queue] •
[**_Brainteaser_**][brainteaser] •
[**_Merge Sort_**][merge sort] •
[**_Iterator_**][iterator] •
[**_Concurrency_**][concurrency] •
[**_DoublyLinked List_**][doubly-linked list] •
[**_Probability and Statistics_**][probability and statistics] •
[**_Quickselect_**][quickselect] •
[**_Bucket Sort_**][bucket sort] •
[**_Suffix Array_**][suffix array] •
[**_Minimum Spanning Tree_**][minimum spanning tree] •
[**_Counting Sort_**][counting sort] •
[**_Shell_**][shell] •
[**_Line Sweep_**][line sweep] •
[**_Reservoir Sampling_**][reservoir sampling] •
[**_Eulerian Circuit_**][eulerian circuit] •
[**_Radix Sort_**][radix sort] •
[**_Strongly Connected Component_**][strongly connected component] •
[**_Rejection Sampling_**][rejection sampling] •
[**_Biconnected Component_**][biconnected component]
### **Total Problems Solved: _193_**
---
## Contributions
- Fork [this repository][leetcode] to your own GitHub account and then clone it to your local machine.
- Checkout a new branch.
- Make some changes to your leetcode repository, then push the changes to your remote GitHub repository.
- Create a pull request with your changes!
- See [CONTRIBUTING](./CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details.
```mermaid
graph TD;
A[rajput-hemant/leetcode] --1--> B[create a fork
your-username/leetcode];
B --2--> C[clone your fork to your local machine];
C --3--> D[checkout new branch,
update or add your solution in relevant folder];
D --4--> E[commit & push changes];
E --5--> B;
B --6--> F[create a pull request];
F --7--> A;
```
## Contributors
[![][contributors]][contributors-graph]
### Show Some ❤️ by giving ⭐ to the Repository
[contributors]: https://contrib.rocks/image?repo=rajput-hemant/leetcode&max=500
[contributors-graph]: https://github.com/rajput-hemant/leetcode/graphs/contributors
[deepsource]: https://deepsource.io/gh/rajput-hemant/leetcode/?ref=repository-badge
[active-issues]: https://deepsource.io/gh/rajput-hemant/leetcode.svg/?label=active+issues&showtrend=true&token=IPVIQX-cSuQSVeVl8cb5PLt
[resolved-issues]: https://deepsource.io/gh/rajput-hemant/leetcode.svg/?label=resolved+issues&showtrend=true&token=IPVIQX-cSuQSVeVl8cb5PLt
[codacy]: https://www.codacy.com/gh/rajput-hemant/leetcode/dashboard?utmsource=github.com&utmmedium=referral&utmcontent=rajput-hemant/leetcode&utmcampaign=BadgeGrade
[code-quality]: https://app.codacy.com/project/badge/Grade/97e3ea868f9344a5aa6e4d874f83db14
[views]: https://komarev.com/ghpvc/?username=leetcode&label=view%20counter&color=red&style=flat
[code-size]: https://img.shields.io/github/languages/code-size/rajput-hemant/leetcode
[issues]: https://img.shields.io/github/issues-raw/rajput-hemant/leetcode
[license]: https://img.shields.io/github/license/rajput-hemant/leetcode
[commit-activity]: https://img.shields.io/github/commit-activity/w/rajput-hemant/leetcode
[forks]: https://img.shields.io/github/forks/rajput-hemant/leetcode?style=flat
[stars]: https://img.shields.io/github/stars/rajput-hemant/leetcode
[leetcode]: https://github.com/rajput-hemant/leetcode
[topicwise]: ./TOPICWISE.md
[serialwise]: ./src/README.md
[array]: ./TOPICWISE.md#array
[string]: ./TOPICWISE.md#string
[hash table]: ./TOPICWISE.md#hash-table
[dynamic programming]: ./TOPICWISE.md#dynamic-programming
[math]: ./TOPICWISE.md#math
[sorting]: ./TOPICWISE.md#sorting
[greedy]: ./TOPICWISE.md#greedy
[depth-first search]: ./TOPICWISE.md#depth-first-search
[database]: ./TOPICWISE.md#database
[breadth-first search]: ./TOPICWISE.md#breadth-first-search
[tree]: ./TOPICWISE.md#tree
[binary search]: ./TOPICWISE.md#binary-search
[matrix]: ./TOPICWISE.md#matrix
[binary tree]: ./TOPICWISE.md#binary-tree
[two pointers]: ./TOPICWISE.md#two-pointers
[bit manipulation]: ./TOPICWISE.md#bit-manipulation
[stack]: ./TOPICWISE.md#stack
[heap ]: ./TOPICWISE.md#heap-priority-queue
[design]: ./TOPICWISE.md#design
[graph]: ./TOPICWISE.md#graph
[prefix sum]: ./TOPICWISE.md#prefix-sum
[simulation]: ./TOPICWISE.md#simulation
[backtracking]: ./TOPICWISE.md#backtracking
[counting]: ./TOPICWISE.md#counting
[sliding window]: ./TOPICWISE.md#sliding-window
[union find]: ./TOPICWISE.md#union-find
[linked list]: ./TOPICWISE.md#linked-list
[ordered set]: ./TOPICWISE.md#ordered-set
[monotonic stack]: ./TOPICWISE.md#monotonic-stack
[enumeration]: ./TOPICWISE.md#enumeration
[recursion]: ./TOPICWISE.md#recursion
[trie]: ./TOPICWISE.md#trie
[divide and conquer]: ./TOPICWISE.md#divide-and-conquer
[binary search tree]: ./TOPICWISE.md#binary-search-tree
[bitmask]: ./TOPICWISE.md#bitmask
[queue]: ./TOPICWISE.md#queue
[memoization]: ./TOPICWISE.md#memoization
[topological sort]: ./TOPICWISE.md#topological-sort
[geometry]: ./TOPICWISE.md#geometry
[segment tree]: ./TOPICWISE.md#segment-tree
[hash function]: ./TOPICWISE.md#hash-function
[game theory]: ./TOPICWISE.md#game-theory
[binary indexed tree]: ./TOPICWISE.md#binary-indexed-tree
[number theory]: ./TOPICWISE.md#number-theory
[interactive]: ./TOPICWISE.md#interactive
[string matching]: ./TOPICWISE.md#string-matching
[rolling hash]: ./TOPICWISE.md#rolling-hash
[data stream]: ./TOPICWISE.md#data-stream
[shortest path]: ./TOPICWISE.md#shortest-path
[combinatorics]: ./TOPICWISE.md#combinatorics
[randomized]: ./TOPICWISE.md#randomized
[monotonic queue]: ./TOPICWISE.md#monotonic-queue
[brainteaser]: ./TOPICWISE.md#brainteaser
[merge sort]: ./TOPICWISE.md#merge-sort
[iterator]: ./TOPICWISE.md#iterator
[concurrency]: ./TOPICWISE.md#concurrency
[doubly-linked list]: ./TOPICWISE.md#doubly-linked-list
[probability and statistics]: ./TOPICWISE.md#probability-and-statistics
[quickselect]: ./TOPICWISE.md#quickselect
[bucket sort]: ./TOPICWISE.md#bucket-sort
[suffix array]: ./TOPICWISE.md#suffix-array
[minimum spanning tree]: ./TOPICWISE.md#minimum-spanning-tree
[counting sort]: ./TOPICWISE.md#counting-sort
[shell]: ./TOPICWISE.md#shell
[line sweep]: ./TOPICWISE.md#line-sweep
[reservoir sampling]: ./TOPICWISE.md#reservoir-sampling
[eulerian circuit]: ./TOPICWISE.md#eulerian-circuit
[radix sort]: ./TOPICWISE.md#radix-sort
[strongly connected component]: ./TOPICWISE.md#strongly-connected-component
[rejection sampling]: ./TOPICWISE.md#rejection-sampling
[biconnected component]: ./TOPICWISE.md#biconnected-component