https://github.com/shreyansh-21/leetcode
This repository contains my solutions to LeetCode problems, covering a wide range of algorithms and data structures. Each solution is well-documented and optimized for performance. The goal is to demonstrate problem-solving skills, coding efficiency, and a deep understanding of algorithmic concepts.
https://github.com/shreyansh-21/leetcode
array binary-search binary-search-tree hashing hashmaps linked-list priority-queue queue recursion stack string trees
Last synced: 12 months ago
JSON representation
This repository contains my solutions to LeetCode problems, covering a wide range of algorithms and data structures. Each solution is well-documented and optimized for performance. The goal is to demonstrate problem-solving skills, coding efficiency, and a deep understanding of algorithmic concepts.
- Host: GitHub
- URL: https://github.com/shreyansh-21/leetcode
- Owner: shreyansh-21
- Created: 2025-03-16T06:12:20.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-03-30T13:16:54.000Z (about 1 year ago)
- Last Synced: 2025-03-30T14:23:54.252Z (about 1 year ago)
- Topics: array, binary-search, binary-search-tree, hashing, hashmaps, linked-list, priority-queue, queue, recursion, stack, string, trees
- Language: Python
- Homepage: https://leetcode.com/u/Shreyansh_Dubey21
- Size: 38.1 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
LeetCode Solutions Sync
This repository serves as a centralized archive for my LeetCode problem solutions,
automatically synchronized to maintain an up-to-date record of my progress.
Overview
This repository is designed to:
- Maintain a structured collection of my LeetCode solutions.
- Track progress and improvements over time.
- Serve as a reference for revisiting past problems.
Repository Structure
Solutions are organized based on the following criteria:
-
Problem Name 📌 -
Difficulty Level (Easy / Medium / Hard) 🎯 -
Algorithmic Concepts & Data Structures (DP, Graphs, Greedy, etc.) 🧩 -
Programming Language (Primarily Python, Javascript) 💻
Automated Syncing
This repository is automatically updated to ensure that all my latest LeetCode submissions are efficiently stored and remain up to date.
Objectives
-
Performance Tracking – Monitor problem-solving progress over time. -
Efficient Reference – Quickly revisit previously solved problems. -
Knowledge Sharing – Provide insights for others working on similar challenges.
How to use
To find a specific solution:
- Navigate through the repository folders.
- Use the search🔍 function to locate a problem by name or topic.
- Review the solution and underlying logic.
If you find this repository helpful, consider starring ⭐ it!
# LeetCode Topics
## Array
| |
| ------- |
| [0031-next-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/0031-next-permutation) |
| [0136-single-number](https://github.com/shreyansh-21/LeetCode/tree/master/0136-single-number) |
| [0217-contains-duplicate](https://github.com/shreyansh-21/LeetCode/tree/master/0217-contains-duplicate) |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
| [0540-single-element-in-a-sorted-array](https://github.com/shreyansh-21/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |
| [0890-lemonade-change](https://github.com/shreyansh-21/LeetCode/tree/master/0890-lemonade-change) |
| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |
| [1584-average-salary-excluding-the-minimum-and-maximum-salary](https://github.com/shreyansh-21/LeetCode/tree/master/1584-average-salary-excluding-the-minimum-and-maximum-salary) |
| [2048-build-array-from-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/2048-build-array-from-permutation) |
| [3321-type-of-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/3321-type-of-triangle) |
| [3747-maximum-difference-between-adjacent-elements-in-a-circular-array](https://github.com/shreyansh-21/LeetCode/tree/master/3747-maximum-difference-between-adjacent-elements-in-a-circular-array) |
## Math
| |
| ------- |
| [0012-integer-to-roman](https://github.com/shreyansh-21/LeetCode/tree/master/0012-integer-to-roman) |
| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |
| [1119-robot-bounded-in-circle](https://github.com/shreyansh-21/LeetCode/tree/master/1119-robot-bounded-in-circle) |
| [1630-count-odd-numbers-in-an-interval-range](https://github.com/shreyansh-21/LeetCode/tree/master/1630-count-odd-numbers-in-an-interval-range) |
| [3321-type-of-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/3321-type-of-triangle) |
## Sorting
| |
| ------- |
| [0217-contains-duplicate](https://github.com/shreyansh-21/LeetCode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/shreyansh-21/LeetCode/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |
| [1584-average-salary-excluding-the-minimum-and-maximum-salary](https://github.com/shreyansh-21/LeetCode/tree/master/1584-average-salary-excluding-the-minimum-and-maximum-salary) |
| [3321-type-of-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/3321-type-of-triangle) |
## Bit Manipulation
| |
| ------- |
| [0136-single-number](https://github.com/shreyansh-21/LeetCode/tree/master/0136-single-number) |
## Simulation
| |
| ------- |
| [0657-robot-return-to-origin](https://github.com/shreyansh-21/LeetCode/tree/master/0657-robot-return-to-origin) |
| [1119-robot-bounded-in-circle](https://github.com/shreyansh-21/LeetCode/tree/master/1119-robot-bounded-in-circle) |
| [2048-build-array-from-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/2048-build-array-from-permutation) |
## Hash Table
| |
| ------- |
| [0012-integer-to-roman](https://github.com/shreyansh-21/LeetCode/tree/master/0012-integer-to-roman) |
| [0217-contains-duplicate](https://github.com/shreyansh-21/LeetCode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/shreyansh-21/LeetCode/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
## String
| |
| ------- |
| [0006-zigzag-conversion](https://github.com/shreyansh-21/LeetCode/tree/master/0006-zigzag-conversion) |
| [0012-integer-to-roman](https://github.com/shreyansh-21/LeetCode/tree/master/0012-integer-to-roman) |
| [0242-valid-anagram](https://github.com/shreyansh-21/LeetCode/tree/master/0242-valid-anagram) |
| [0657-robot-return-to-origin](https://github.com/shreyansh-21/LeetCode/tree/master/0657-robot-return-to-origin) |
| [1119-robot-bounded-in-circle](https://github.com/shreyansh-21/LeetCode/tree/master/1119-robot-bounded-in-circle) |
## Binary Search
| |
| ------- |
| [0540-single-element-in-a-sorted-array](https://github.com/shreyansh-21/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |
## Greedy
| |
| ------- |
| [0890-lemonade-change](https://github.com/shreyansh-21/LeetCode/tree/master/0890-lemonade-change) |
| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |
## Divide and Conquer
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
## Heap (Priority Queue)
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
## Counting
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
## Quickselect
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |
## Two Pointers
| |
| ------- |
| [0031-next-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/0031-next-permutation) |