{"id":19260198,"url":"https://github.com/kulikov-dev/leetcodenet","last_synced_at":"2025-09-13T03:33:58.763Z","repository":{"id":45861390,"uuid":"514193271","full_name":"kulikov-dev/LeetCodeNet","owner":"kulikov-dev","description":"LeetCode problems with detailed explanation and different solutions.","archived":false,"fork":false,"pushed_at":"2023-06-18T04:48:48.000Z","size":531,"stargazers_count":50,"open_issues_count":0,"forks_count":4,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-21T16:40:29.094Z","etag":null,"topics":["algorithm","clean-code","coding-interviews","easy-to-understand","hackerrank","hacktoberfest","interview","interview-questions","interviews","leetcode","leetcode-solutions","tech-interviews","xunit"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kulikov-dev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-07-15T08:28:31.000Z","updated_at":"2025-02-24T09:04:28.000Z","dependencies_parsed_at":"2024-11-09T19:30:02.450Z","dependency_job_id":null,"html_url":"https://github.com/kulikov-dev/LeetCodeNet","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kulikov-dev/LeetCodeNet","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kulikov-dev%2FLeetCodeNet","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kulikov-dev%2FLeetCodeNet/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kulikov-dev%2FLeetCodeNet/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kulikov-dev%2FLeetCodeNet/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kulikov-dev","download_url":"https://codeload.github.com/kulikov-dev/LeetCodeNet/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kulikov-dev%2FLeetCodeNet/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264923827,"owners_count":23683820,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","clean-code","coding-interviews","easy-to-understand","hackerrank","hacktoberfest","interview","interview-questions","interviews","leetcode","leetcode-solutions","tech-interviews","xunit"],"created_at":"2024-11-09T19:19:19.078Z","updated_at":"2025-07-12T02:12:03.079Z","avatar_url":"https://github.com/kulikov-dev.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"## LeetCodeNet\nLeetCode problems with clean code, detailed explanations and different easy-understandable solutions.\nAll problems are grouped by patterns, so you can train in solving of specific type of problems.\n\n### Level: Easy\n\n#### Pattern: without\n* #9: Palindrome Number (Math)\n* #13: Roman to Integer (Math)\n* #20: Valid Parentheses (String)\n* #21: Merge Two Sorted Lists (Linked List)\n* #66: Plus One (Array)\n* #118: Pascal's Triangle (DP)\n* #155: Min Stack (DP)\n* #202: Happy Number (Math)\n* #206: Reverse Linked List (Linked list)\n* #225: Implement Stack using Queues (Design)\n* #232: Implement Queue using Stacks (Design)\n* #237: Delete Node in a Linked List (Linked list)\n* #303: Range Sum Query - Immutable (Design)\n* #412: FizzBuzz (Math, Design)\n* #414: Third Maximum Number (Array)\n* #485: Max Consecutive Ones (Array)\n* #566: Reshape the Matrix (Array)\n* #844: Backspace String Compare (Array, Stack)\n* #867: Transpose Matrix (Array)\n* #976: Largest Perimeter Triangle (Math)\n* #1232: Check If It Is a Straight Line (Math)\n* #1281: Subtract the Product and Sum of Digits of an Integer (Math)\n* #1295: Find Numbers with Even Number of Digits (Math, Array)\n* #1299: Replace Elements with Greatest Element on Right Side (Array)\n* #1431: Kids With the Greatest Number of Candies (Array)\n* #1502: Can Make Arithmetic Progression From Sequence (Math, Array)\n* #1523: Count Odd Numbers in an Interval Range (Array)\n* #1539^ Kth missing positive number (Array)\n* #1572: Matrix Diagonal Sum (Array)\n* #1588: Sum of All Odd Length Subarrays (Array)\n* #1603: Design Parking System (Design)\n* #1672: Richest Customer Wealth (Array)\n* #1678: Goal Parser Interpretation (String)\n* #1732: Find the Highest Altitude (Array)\n* #1768: Merge Strings Alternately (String)\n* #1822: Sign of the Product of an Array (Math)\n* #1974: Minimum Time to Type Word Using Special Typewriter (String)\n* #2643: Row With Maximum Ones (Array)\n* #2660: Determine the Winner of a Bowling Game (Array)\n* #2716: Minimize String Length (String)\n* #2733: Neither Minimum nor Maximum (Array)\n* #2739: Total Distance Traveled (Math)\n#### Pattern: Sorting\n* #14: Longest Common Prefix (String)\n* #217: Contains Duplicate (Array)\n* #448: Find All Numbers Disappeared in an Array (Array)\n* #1046: Last Stone Weight (Array, PriorityQueue)\n* #1051: Height Checker (Array, Bucket)\n* #1491: Average Salary Excluding the Minimum and Maximum Salary (Array)\n#### Pattern: Prefix sum\n* #724: Find Pivot Index (Array)\n* #1480: Running Sum of 1d Array (Array)\n* #2670: Find the Distinct Difference Array (Array)\n#### Pattern: Breadth-First search (BFS)\n* #104: Maximum Depth of Binary Tree (Tree)\n* #112: Path Sum (Tree)\n* #144: Binary Tree Preorder Traversal (Tree)\n* #145: Binary Tree Postorder Traversal (Tree)\n* #226: Invert Binary Tree (Tree)\n* #404: Sum of Left Leaves (Tree)\n* #617: Merge Two Binary Trees (Tree)\n* #637: Average of Levels in Binary Tree (Tree)\n* #733: Flood Fill (Array)\n#### Pattern: Depth-First search (DFS)\n* #94: Binary Tree Inorder Traversal (Tree)\n* #101: Symmetric Tree (Tree)\n* #589: N-ary Tree Preorder Traversal (Tree)\n#### Pattern: Binary tree\n* #235:  Lowest Common Ancestor of a Binary Search Tree (Tree)\n* #700: Search in a Binary Search Tree (Tree)\n#### Pattern: Two pointers\n* #26: Remove Duplicates from Sorted Array (Array)\n* #27: Remove Element (Array)\n* #83: Remove Duplicates from Sorted List (Linked List)\n* #125: Valid Palindrome (String)\n* #169: Majority Element (Array)\n* #203: Remove Linked List Elements (Linked List)\n* #283: Move Zeroes (Array)\n* #344: Reverse String (String)\n* #345: Reverse Vowels of a String (String)\n* #387: First Unique Character in a String (String)\n* #350: Intersection of Two Arrays II (Array)\n* #392: Is Subsequence (String)\n* #557: Reverse Words in a String III (String)\n* #696: Count Binary Substrings (String)\n* #905: Sort Array By Parity (Array)\n* #941: Valid Mountain Array (Array)\n* #977: Squares of a Sorted Array (Array)\n* #1089: Duplicate Zeroes (Array)\n* #1790: Check if One String Swap Can Make Strings Equal (String)\n* #2697: Lexicographically Smallest Palindrome (String)\n* #2717: Semi-Ordered Permutation (Array)\n#### Pattern: Two pointers: slow/fast\n* #141: Linked List Cycle (Linked List)\n* #234: Palindrome Linked List (Linked List)\n* #876: Middle of the LInked List (Linked List)\n#### Pattern: Hash table\n* #1: Two Sum (Array)\n* #205: Isomorphic Strings (String)\n* #242: Valid Anagram (String)\n* #350: Intersection of Two Arrays II (Array)\n* #383: Ransom note (String)\n* #389: Find the Difference (String)\n* #409: Longest Palindrome (String)\n* #705: Design HashSet (Design)\n* #706: Design HashMap (Design)\n* #953: Verifying an Alien Dictionary (String)\n* #1346: Check If N and Its Double Exist (Array)\n* #1394: Find Lucky Integer in an Array (Array)\n* #2049: Finding 3-Digit Even Numbers (Array)\n#### Pattern: Monotonic stack\n* #496: Next Greater Element I (Array)\n#### Pattern: Char manipulation\n* #709: To Lower Case (String)\n* #1309: Decrypt String from Alphabet to Integer Mapping (String)\n* #1844: Replace All Digits with Characters (String)\n#### Pattern: Bit manipulation\n* #136: Single number (Array)\n* #190: Reverse bits (Bits)\n* #191: Number of 1 Bits (Bits)\n* #231: Power of Two (Bits)\n* #268: Missing Number (Array)\n* #461: Hamming Distance (Bits)\n* #1290: Convert Binary Number in a Linked List to Integer (Linked List)\n* #1342: Number of Steps to Reduce a Number to Zero (Bits)\n* #1356: Sort Integers by The Number of 1 Bits (Array)\n#### Pattern: KMP algorithm\n* #28: Implement strStr (String)\n#### Pattern: Divide and conquer\n* #108: Convert Sorted Array to Binary Search Tree (Tree)\n#### Pattern: Binary search\n* #35: Search Insert Position (Array)\n* #69: Sqrt(x) (Math)\n* #278: First Bad Version (Array)\n* #367: Valid Perfect Square (Math)\n* #374: Guess Number Higher or Lower (Array)\n* #653: Two Sum IV - Input is a BST (Tree)\n* #704: Binary Search (Array)\n* #744: Find Smallest Letter Greater Than Target (Array)\n* #1337: The K Weakest Rows in a Matrix (Array)\n* #1351: Count Negative Numbers in a Sorted Matrix (Array)\n* #1385: Find the Distance Value Between Two Arrays (Array)\n* #1608: Special Array With X Elements Greater Than or Equal X (Array)\n#### Pattern: Dynamic programming\n* #70: Climbing stairs (Bottom-up)\n* #746: Min Cost Climbing Stairs (Bottom-up)\n* #509: Fibonacci Number (Bottom-up)\n* #605: Can Place Flowers (Bottom-up)\n#### Pattern: Kadane's algorithm\n* #121: Best Time to Buy and Sell Stock (DP)\n#### Pattern: Greedy\n* #2696: Minimum String Length After Removing Substrings (String)\n\n### Level: Medium\n\n#### Pattern: without\n* #2: Add Two Numbers (Linked list)\n* #7: Reverse Integer (Math)\n* #38: Count and say (String)\n* #54: Spiral Matrix (Array)\n* #71: Simplify Path (String)\n* #382: Linked List Random Node (Linked list, Design)\n* #394: Decode String (String, Stack)\n* #848: Shifting Letters (String)\n* #1328: Break a Palindrome (String)\n* #1472: Design Browser History (Linked List, Design)\n* #1980: Find Unique Binary String (Array)\n* #2348: Number of Zero-Filled Subarrays (Math, Array)\n* #2671: Frequency Tracker (Design)\n* #2672: Number of Adjacent Elements With the Same Color (Array)\n* #2718: Sum of Matrix After Queries (Array)\n* #2734: Lexicographically Smallest String After Substring Operation (String)\n#### Pattern: Sorting\n* #347: Top K Frequent Elements (Array)\n* #692: Top K Frequent Words (Array, Bucket)\n* #2300: Successful Pairs of Spells and Potions (Array)\n* #2740: Find the Value of the Partition (Array)\n#### Pattern: Binary search\n* #33: Search in Rotated Sorted Array (Array)\n* #34: Find First and Last Position of Element in Sorted Array (Array)\n* #74: Search a 2D Matrix (Array)\n* #153: Find Minimum in Rotated Sorted Array (Array)\n* #852: Peak Index in a Mountain Array (Array)\n#### Pattern: Two pointers\n* #5: Longest Palindromic Substring (String)\n* #88: Merge Sorted Array (Array)\n* #142: Linked List Cycle II (Linked List)\n* #167: Two Sum II - Input Array Is Sorted (Array)\n* #633: Sum of Square Numbers (Math)\n* #881: Boats to Save People (Array)\n* #946: Validate Stack Sequences (Array)\n* #1004: Max Consecutive Ones III (Array)\n* #1855: Maximum Distance Between a Pair of Values (Array)\n* #2390: Removing Stars From a String (String)\n#### Pattern: Two pointers: slow/fast\n* #109: Convert Sorted List to Binary Search Tree (Tree, Linked list)\n#### Pattern: Hash table\n* #299: Bulls and Cows (Array)\n* #2661: First Completely Painted Row or Column (Array)\n#### Pattern: Sliding window\n* #3: Longest Substring Without Repeating Characters (String)\n* #424: Longest Repeating Character Replacement (String)\n* #438: Find All Anagrams in a String (String)\n* #567: Permutation in String (String)\n* #1456: Maximum Number of Vowels in a Substring of Given Length (String)\n#### Pattern: Prefix sum\n* #2439: Minimize Maximum of Array (Array)\n#### Pattern: Kadane's algorithm\n* #53: Maximum Subarray (Array)\n#### Pattern: Backtracking\n* #46: Permutations (Array)\n* #211: Design Add and Search Words Data Structure (Prefix Tree, Design)\n* #784: Letter Case Permutation (String)\n* #2698: Find the Punishment Number of an Integer (Math)\n#### Pattern: Binary tree\n* #98: Validate Binary Search Tree (Tree)\n#### Pattern: Breadth-First search (BFS)\n* #102: Binary Tree Level Order Traversal (Tree)\n* #133: Clone Graph (Graph)\n* #958: Check Completeness of a Binary Tree (Tree)\n* #1466: Reorder Routes to Make All Paths Lead to the City Zero (Graph)\n* #2583: Kth Largest Sum in a Binary Tree (Tree)\n#### Pattern: Depth-First search (DFS)\n* #129: Sum Root to Leaf Numbers (Tree)\n* #200: Number of Islands (Array)\n* #207: Course Schedule (Tree, Topological sort)\n* #994: Rotting Oranges (Array)\n* #1020: Number of Enclaves (Array)\n#### Pattern: Bit manipulation\n* #2405: Optimal Partition of String (String)\n#### Pattern: Prefix Tree\n* #208: Implement Trie (Design)\n#### Pattern: Dynamic programming\n* #62: Unique Paths (Bottom-up, Array)\n* #63: Minimum Path Sum (Bottom-up, Array)\n* #516: Longest Palindromic Subsequence (Bottom-up, String)\n* #983: Minimum Cost For Tickets (Bottom-up, Array)\n#### Pattern: Union-Find\n* #1319: Number of Operations to Make Network Connected (Graph)\n* #2316: Count Unreachable Pairs of Nodes in an Undirected Graph (Graph)\n\n### Level: Hard\n\n#### Pattern: without\n\n* #23: Merge k Sorted Lists (Linked list)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkulikov-dev%2Fleetcodenet","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkulikov-dev%2Fleetcodenet","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkulikov-dev%2Fleetcodenet/lists"}