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.
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.
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:
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.
Download from Chrome Web Store The preferred way to install LeetHub is through the Chrome Web Store. Updates will be installed automatically.
If you prefer manual installation, follow these steps:
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.
Enable Developer mode by toggling the switch in the top-right corner.
Click "Load unpacked."
Select the entire LeetHub folder.
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.
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.
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.
The repository is organized as follows:
To get started, follow these steps:
-
Clone the repository:
git clone https://github.com/username/repository-name.git cd repository-name -
Install the required dependencies:
pip install -r requirements.txt
-
Follow the instructions in the relevant folders to run the code examples or access the resources.
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).
If you have any questions or feedback, feel free to reach out:
| 1006-vowel-spellchecker |
| 2887-sort-vowels-in-a-string |
| 3872-find-most-frequent-vowel-and-consonant |
| 2887-sort-vowels-in-a-string |
| 0493-reverse-pairs |
| 1006-vowel-spellchecker |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 1006-vowel-spellchecker |
| 3872-find-most-frequent-vowel-and-consonant |
| 3872-find-most-frequent-vowel-and-consonant |