Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ash0508/leetcode
This plugin will automatically push your code to GitHub after you successfully pass all tests for a Leetcode problem.
https://github.com/ash0508/leetcode
automation extension-chrome leetcode leethub
Last synced: 7 days ago
JSON representation
This plugin will automatically push your code to GitHub after you successfully pass all tests for a Leetcode problem.
- Host: GitHub
- URL: https://github.com/ash0508/leetcode
- Owner: Ash0508
- Created: 2023-10-14T09:01:10.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-09-15T21:10:23.000Z (2 months ago)
- Last Synced: 2024-09-16T10:07:02.119Z (2 months ago)
- Topics: automation, extension-chrome, leetcode, leethub
- Language: Java
- Homepage: https://github.com/Ash0508/Leetcode
- Size: 458 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetHub
LeetHub is a Chrome extension that automatically pushes your code to GitHub when you pass all tests on a LeetCode problem. It is a fork of LeetHub-2.0, which is no longer compatible with LeetCode due to recent updates.
# Why LeetHub?
LeetCode problems are not easily accessible in one place, and manually pushing code to GitHub from LeetCode can be time-consuming. LeetHub automates this process, saving you time and effort by eliminating the need for manual uploads.
# Supported UI
LeetHub supports two different LeetCode UIs. Please note that there are known issues with the "non-dynamic layout." For optimal performance, use one of the following:
# Old layout
New "dynamic layout"
Manual Synchronization
If you update the text in the editor too quickly, your submission may not upload to GitHub successfully. It is necessary to wait for 4 seconds (until the spinner stops) after submitting your solution before making any changes, switching languages, or switching editors. During this period, your solution is being pushed to GitHub, and the website layout should remain unchanged. We apologize for this inconvenience and are open to any solutions or improvements you may have.
A manual synchronization button is available next to the notes icon. Use this button only after successfully submitting your solution to LeetCode. You can also push previous submissions to GitHub by selecting the submission and clicking the manual synchronization button.
# Installation
Download from Chrome Web Store
The preferred way to install LeetHub is through the Chrome Web Store. Updates will be installed automatically.
# Manual Installation
If you prefer manual installation, follow these steps:
# Create your own OAuth app in GitHub:
Go to GitHub OAuth Applications
Application Name: [CUSTOM]
Homepage URL: https://github.com/Ash0508/Leetcode
Authorization Callback URL: https://github.com/
Store CLIENT_ID and CLIENT_SECRET confidentially.
Download the project ZIP from the Releases section or clone the repository.
Run npm run setup to install the developer dependencies.
Update CLIENT_ID and CLIENT_SECRET in scripts/authorize.js and scripts/oauth2.js with your credentials.
# Go to chrome://extensions.
Enable Developer mode by toggling the switch in the top-right corner.
Click "Load unpacked."
Select the entire LeetHub folder.
# Setup
After installing LeetHub, launch the extension.
Click on "Authorize with GitHub" to set up your account with LeetHub.
Set up an existing or new repository with LeetHub (default is private) by clicking "Get Started."
Start coding on LeetCode! To view your progress, simply click on the extension.
# LeetCode Solutions in JAVA
Welcome to my LeetCode Solutions repository! Here, I have uploaded solutions to more than 100 LeetCode problems. Each solution is written in Java and is accompanied by the problem statement for easy reference.
## Table of Contents
- [Introduction](#introduction)
- [Structure of the Repository](#structure-of-the-repository)
- [How to Use](#how-to-use)
- [Topics Covered](#topics-covered)
- [Contact](#contact)
- [License](#license)
## Introduction
Welcome to the [Repository Name]! This repository is designed to provide comprehensive resources on various [topics covered]. Whether you're a student, developer, or data scientist, you'll find valuable information and code examples to help you understand and implement these concepts.
## Structure of the Repository
The repository is organized as follows:
| Problem # | Problem Title | Execution Time | Memory Usage |
|-----------|-----------------------------------------------------------|----------------|---------------|
| 0001 | [Two Sum](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0001-two-sum) | 2 ms | 44.7 MB |
| 0002 | [Add Two Numbers](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0002-add-two-numbers) | 2 ms | 44.1 MB |
| 0003 | [Longest Substring Without Repeating Characters](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0003-longest-substring-without-repeating-characters) | 6 ms | 44.5 MB |
| 0004 | [Median of Two Sorted Arrays](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0004-median-of-two-sorted-arrays) | 2 ms | 45.9 MB |
| 0007 | [Reverse Integer](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0007-reverse-integer) | 0 ms | 40.9 MB |
| 0014 | [Longest Common Prefix](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0014-longest-common-prefix) | 3 ms | 9.5 MB |
| 0015 | [3Sum](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0015-3sum) | 28 ms | 51.3 MB |
| 0016 | [3Sum Closest](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0016-3sum-closest) | 16 ms | 42.6 MB |
| 0019 | [Remove Nth Node From End of List](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0019-remove-nth-node-from-end-of-list) | 0 ms | 41.5 MB |
| 0021 | [Merge Two Sorted Lists](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0021-merge-two-sorted-lists) | 0 ms | 42.7 MB |
| 0022 | [Generate Parentheses](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0022-generate-parentheses) | 1 ms | 41.8 MB |
| 0023 | [Merge K Sorted Lists](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0023-merge-k-sorted-lists) | 98 ms | 20.9 MB |
| 0024 | [Swap Nodes in Pairs](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0024-swap-nodes-in-pairs) | 0 ms | 7.8 MB |
| 0025 | [Reverse Nodes in K-Group](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0025-reverse-nodes-in-k-group) | 3 ms | 44.2 MB |
| 0026 | [Remove Duplicates from Sorted Array](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0026-remove-duplicates-from-sorted-array) | 1 ms | 44.9 MB |
| 0028 | [Find the Index of the First Occurrence in a String](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0028-find-the-index-of-the-first-occurrence-in-a-string) | 0 ms | 41.3 MB |
| 0029 | [Divide Two Integers](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0029-divide-two-integers) | 1 ms | 40 MB |
| 0030 | [Substring with Concatenation of All Words](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0030-substring-with-concatenation-of-all-words) | 2154 ms | 45.2 MB |
| 0031 | [Next Permutation](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0031-next-permutation) | 0 ms | 42.8 MB |
| 0032 | [Longest Valid Parentheses](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0032-longest-valid-parentheses) | 46 ms | 16.9 MB |
| 0033 | [Search in Rotated Sorted Array](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0033-search-in-rotated-sorted-array) | 40 ms | 16.4 MB |
| 0034 | [Find First and Last Position of Element in Sorted Array](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0034-find-first-and-last-position-of-element-in-sorted-array) | 83 ms | 17.7 MB |
| 0035 | [Search Insert Position](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0035-search-insert-position) | 55 ms | 17.1 MB |
| 0036 | [Valid Sudoku](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0036-valid-sudoku) | 19 ms | 44.7 MB |
| 0037 | [Sudoku Solver](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0037-sudoku-solver) | 8 ms | 40.8 MB |
| 0038 | [Count and Say](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0038-count-and-say) | 62 ms | 16.2 MB |
| 0039 | [Combination Sum](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0039-combination-sum) | 8 ms | 11.1 MB |
| 0040 | [Combination Sum II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0040-combination-sum-ii) | 13 ms | 11.8 MB |
| 0041 | [First Missing Positive](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0041-first-missing-positive) | Attach NOTES | 8 months ago |
| 0042 | [Trapping Rain Water](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0042-trapping-rain-water) | 1 ms | 45.4 MB |
| 0043 | [Multiply Strings](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0043-multiply-strings) | 10 ms | 42.8 MB |
| 0044 | [Wildcard Matching](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0044-wildcard-matching) | 881 ms | 661.9 MB |
| 0045 | [Jump Game II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0045-jump-game-ii) | 1 ms | 44.2 MB |
| 0046 | [Permutations](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0046-permutations) | 1 ms | 44.3 MB |
| 0047 | [Permutations II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0047-permutations-ii) | 160 ms | 40.9 MB |
| 0048 | [Rotate Image](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0048-rotate-image) | 4 ms | 7.6 MB |
| 0049 | [Group Anagrams](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0049-group-anagrams) | 6 ms | 47.2 MB |
| 0050 | [Pow(x, n)](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0050-powx-n) | 4 ms | 7.9 MB |
| 0051 | [N-Queens](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0051-n-queens) | 12 ms | 45.1 MB |
| 0053 | [Maximum Subarray](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0053-maximum-subarray) | 1 ms | 56.7 MB |
| 0056 | [Merge Intervals](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0056-merge-intervals) | 4 ms | 44.7 MB |
| 0061 | [Rotate List](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0061-rotate-list) | 0 ms | 40.2 MB |
| 0062 | [Unique Paths](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0062-unique-paths) | 0 ms | 39.4 MB |
| 0063 | [Unique Paths II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0063-unique-paths-ii) | 0 ms | 39.4 MB |
| 0064 | [Minimum Path Sum](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0064-minimum-path-sum) | 4 ms | 15.4 MB |
| 0065 | [Valid Number](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0065-valid-number) | 4 ms | 39.1 MB |
| 0066 | [Plus One](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0066-plus-one) | 0 ms | 37.9 MB |
| 0067 | [Add Binary](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0067-add-binary) | 0 ms | 37.9 MB |
| 0069 | [Sqrt(x)](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0069-sqrt-x) | 0 ms | 5.7 MB |
| 0070 | [Climbing Stairs](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0070-climbing-stairs) | 0 ms | 35.6 MB |
| 0071 | [Simplify Path](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0071-simplify-path) | 3 ms | 39.5 MB |
| 0072 | [Edit Distance](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0072-edit-distance) | 7 ms | 39.3 MB |
| 0073 | [Set Matrix Zeroes](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0073-set-matrix-zeroes) | 5 ms | 15.3 MB |
| 0074 | [Search a 2D Matrix](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0074-search-a-2d-matrix) | 0 ms | 38.8 MB |
| 0075 | [Sort Colors](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0075-sort-colors) | 0 ms | 37.9 MB |
| 0076 | [Minimum Window Substring](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0076-minimum-window-substring) | 6 ms | 9.7 MB |
| 0077 | [Combinations](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0077-combinations) | 1 ms | 32.8 MB |
| 0078 | [Subsets](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0078-subsets) | 1 ms | 34.1 MB |
| 0079 | [Word Search](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0079-word-search) | 190 ms | 15.1 MB |
| 0080 | [Remove Duplicates from Sorted Array II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0080-remove-duplicates-from-sorted-array-ii) | 0 ms | 37.9 MB |
| 0081 | [Search in Rotated Sorted Array II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0081-search-in-rotated-sorted-array-ii) | 0 ms | 39.5 MB |
| 0082 | [Remove Duplicates from Sorted List II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0082-remove-duplicates-from-sorted-list-ii) | 1 ms | 36.4 MB |
| 0083 | [Remove Duplicates from Sorted List](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0083-remove-duplicates-from-sorted-list) | 0 ms | 36.6 MB |
| 0084 | [Largest Rectangle in Histogram](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0084-largest-rectangle-in-histogram) | 17 ms | 19.1 MB |
| 0085 | [Maximal Rectangle](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0085-maximal-rectangle) | 17 ms | 19.5 MB |
| 0086 | [Partition List](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0086-partition-list) | 0 ms | 39.4 MB |
| 0087 | [Scramble String](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0087-scramble-string) | 3 ms | 39.5 MB |
| 0088 | [Merge Sorted Array](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0088-merge-sorted-array) | 0 ms | 39.5 MB |
| 0089 | [Gray Code](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0089-gray-code) | 0 ms | 37.9 MB |
| 0090 | [Subsets II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0090-subsets-ii) | 1 ms | 39.5 MB |
| 0091 | [Decode Ways](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0091-decode-ways) | 1 ms | 37.1 MB |
| 0092 | [Reverse Linked List II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0092-reverse-linked-list-ii) | 0 ms | 36.7 MB |
| 0093 | [Restore IP Addresses](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0093-restore-ip-addresses) | 1 ms | 35.9 MB |
| 0094 | [Binary Tree Inorder Traversal](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0094-binary-tree-inorder-traversal) | 0 ms | 37.1 MB |
| 0095 | [Unique Binary Search Trees II](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0095-unique-binary-search-trees-ii) | 1 ms | 38.1 MB |
| 0096 | [Unique Binary Search Trees](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0096-unique-binary-search-trees) | 0 ms | 36.8 MB |
| 0097 | [Interleaving String](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0097-interleaving-string) | 2 ms | 39.4 MB |
| 0098 | [Validate Binary Search Tree](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0098-validate-binary-search-tree) | 0 ms | 41.2 MB |
| 0099 | [Recover Binary Search Tree](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0099-recover-binary-search-tree) | 1 ms | 39.5 MB |
| 0100 | [Same Tree](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0100-same-tree) | 0 ms | 37.1 MB |
| 0101 | [Symmetric Tree](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0101-symmetric-tree) | 0 ms | 38.4 MB |
| 0102 | [Binary Tree Level Order Traversal](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0102-binary-tree-level-order-traversal) | 0 ms | 39.7 MB |
| 0103 | [Binary Tree Zigzag Level Order Traversal](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0103-binary-tree-zigzag-level-order-traversal) | 0 ms | 39.8 MB |
| 0104 | [Maximum Depth of Binary Tree](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0104-maximum-depth-of-binary-tree) | 0 ms | 40.1 MB |
| 0105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/Ash0508/LeetCode-Solutions/tree/main/0105-construct-binary-tree-from-preorder-and-inorder-traversal) | 1 ms | 39.7 MB |
## How to Use
To get started, follow these steps:
1. Clone the repository:
```bash
git clone https://github.com/username/repository-name.git
cd repository-name
```
2. Install the required dependencies:
```bash
pip install -r requirements.txt
```
3. Follow the instructions in the relevant folders to run the code examples or access the resources.
## Topics Covered
This repository covers the following topics:
- **Arrays**: Techniques for manipulating and traversing arrays.
- **Linked Lists**: Implementations and algorithms involving singly and doubly linked lists.
- **Stacks and Queues**: Concepts, operations, and applications of stacks and queues.
- **Trees**: Tree traversal methods, binary search trees, AVL trees, and other tree-based structures.
- **Graphs**: Graph representation, traversal algorithms (BFS, DFS), shortest path algorithms (Dijkstra, Bellman-Ford).
- **Hashing**: Hash tables, hash functions, and collision resolution strategies.
- **Dynamic Programming**: Solving problems using memoization and tabulation techniques.
- **Recursion**: Understanding and applying recursive algorithms.
- **Sorting and Searching**: Various sorting algorithms (Quick Sort, Merge Sort, Heap Sort) and searching techniques.
- **Greedy Algorithms**: Strategies for making the locally optimal choice at each step.
- **Bit Manipulation**: Performing operations directly on bits for optimization.
- **Backtracking**: Techniques for solving constraint satisfaction problems.
- **Strings**: String manipulation, pattern matching algorithms, and parsing.
- **Mathematics**: Number theory, combinatorics, and other mathematical concepts in problem-solving.
- **Geometry**: Computational geometry algorithms.
- **Advanced Data Structures**: Heaps, Tries, Segment Trees, Fenwick Trees, and Disjoint Set Union (DSU).
## Contact
If you have any questions or feedback, feel free to reach out:
- [GitHub Issues](https://github.com/Ash0508/Leetcode/issues)
- [Leetcode-Profile](https://leetcode.com/u/Ankush0508/)
- [Coding-Ninjas-Profile](https://www.naukri.com/code360/profile/luvkush0805)
- [Geeks-for-Geeks](https://www.geeksforgeeks.org/user/singhankush0508luvkush/?utm_source=geeksforgeeks&utm_medium=my_profile&utm_campaign=auth_user)
- [LinkedIn](https://www.linkedin.com/in/ankush-singh-4459a824a/)
- [Twitter](https://x.com/AnkushS00373636)