{"id":19722314,"url":"https://github.com/kzamanbd/leetcode-problem","last_synced_at":"2025-02-27T18:29:11.331Z","repository":{"id":212766571,"uuid":"732265867","full_name":"kzamanbd/leetcode-problem","owner":"kzamanbd","description":"Welcome to our Problem-Solving Repository! This repository is a curated collection of solutions and resources aimed at addressing a variety of challenges encountered in software industry. Whether you're a developer, a project manager, or an enthusiast in software development field...","archived":false,"fork":false,"pushed_at":"2024-01-17T08:58:56.000Z","size":17,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-10T16:25:41.864Z","etag":null,"topics":["cpp","leetcode","leetcode-solutions","problemsolving"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kzamanbd.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2023-12-16T05:15:47.000Z","updated_at":"2023-12-31T04:44:18.000Z","dependencies_parsed_at":"2024-01-17T10:16:31.405Z","dependency_job_id":"d58d536d-e449-4f81-8ceb-7fa7e72d369d","html_url":"https://github.com/kzamanbd/leetcode-problem","commit_stats":null,"previous_names":["kzamanbd/leetcode-cpp","kzamanbd/leetcode-problem"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kzamanbd%2Fleetcode-problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kzamanbd%2Fleetcode-problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kzamanbd%2Fleetcode-problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kzamanbd%2Fleetcode-problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kzamanbd","download_url":"https://codeload.github.com/kzamanbd/leetcode-problem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241044349,"owners_count":19899497,"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":["cpp","leetcode","leetcode-solutions","problemsolving"],"created_at":"2024-11-11T23:16:58.930Z","updated_at":"2025-02-27T18:29:11.298Z","avatar_url":"https://github.com/kzamanbd.png","language":null,"readme":"# LeetCode Problem \u0026 Solution\n\nBoost your coding interview skills and confidence by practicing real interview questions with LeetCode. Our platform offers a range of essential problems\n\n## Top 75 LeetCode Questions to Crack The Coding Interviews\n\n\u003e Click :star: if you like the project. Pull Request are highly appreciated.\n\n---\n\n## Array\n\n- [ ] [Two Sum](https://leetcode.com/problems/two-sum/)\n- [ ] [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n- [ ] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)\n- [ ] [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)\n- [ ] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)\n- [ ] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)\n- [ ] [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n- [ ] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n- [ ] [3Sum](https://leetcode.com/problems/3sum/)\n- [ ] [Container With Most Water](https://leetcode.com/problems/container-with-most-water/)\n\n---\n\n## Binary\n\n- [ ] [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)\n- [ ] [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)\n- [ ] [Counting Bits](https://leetcode.com/problems/counting-bits/)\n- [ ] [Missing Number](https://leetcode.com/problems/missing-number/)\n- [ ] [Reverse Bits](https://leetcode.com/problems/reverse-bits/)\n\n---\n\n## Interval\n\n- [ ] [Insert Interval](https://leetcode.com/problems/insert-interval/)\n- [ ] [Merge Intervals](https://leetcode.com/problems/merge-intervals/)\n- [ ] [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)\n- [ ] [Meeting Rooms (Leetcode Premium)](https://leetcode.com/problems/meeting-rooms/)\n- [ ] [Meeting Rooms II (Leetcode Premium)](https://leetcode.com/problems/meeting-rooms-ii/)\n\n---\n\n## Linked List\n\n- [ ] [Reverse a Linked List](https://leetcode.com/problems/reverse-linked-list/)\n- [ ] [Detect Cycle in a Linked List](https://leetcode.com/problems/linked-list-cycle/)\n- [ ] [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)\n- [ ] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)\n- [ ] [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n- [ ] [Reorder List](https://leetcode.com/problems/reorder-list/)\n\n---\n\n## Matrix\n\n- [ ] [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)\n- [ ] [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)\n- [ ] [Rotate Image](https://leetcode.com/problems/rotate-image/)\n- [ ] [Word Search](https://leetcode.com/problems/word-search/)\n\n---\n\n## String\n\n- [ ] [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n- [ ] [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)\n- [ ] [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)\n- [ ] [Valid Anagram](https://leetcode.com/problems/valid-anagram/)\n- [ ] [Group Anagrams](https://leetcode.com/problems/group-anagrams/)\n- [ ] [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)\n- [ ] [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)\n- [ ] [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)\n- [ ] [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)\n- [ ] [Encode and Decode Strings (Leetcode Premium)](https://leetcode.com/problems/encode-and-decode-strings/)\n\n---\n\n## Tree\n\n- [ ] [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)\n- [ ] [Same Tree](https://leetcode.com/problems/same-tree/)\n- [ ] [Invert/Flip Binary Tree](https://leetcode.com/problems/invert-binary-tree/)\n- [ ] [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n- [ ] [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n- [ ] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n- [ ] [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)\n- [ ] [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n- [ ] [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)\n- [ ] [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n- [ ] [Lowest Common Ancestor of BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n- [ ] [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)\n- [ ] [Add and Search Word](https://leetcode.com/problems/add-and-search-word-data-structure-design/)\n- [ ] [Word Search II](https://leetcode.com/problems/word-search-ii/)\n\n---\n\n## Dynamic Programming\n\n- [ ] [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)\n- [ ] [Coin Change](https://leetcode.com/problems/coin-change/)\n- [ ] [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)\n- [ ] [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)\n- [ ] [Word Break Problem](https://leetcode.com/problems/word-break/)\n- [ ] [Combination Sum](https://leetcode.com/problems/combination-sum-iv/)\n- [ ] [House Robber](https://leetcode.com/problems/house-robber/)\n- [ ] [House Robber II](https://leetcode.com/problems/house-robber-ii/)\n- [ ] [Decode Ways](https://leetcode.com/problems/decode-ways/)\n- [ ] [Unique Paths](https://leetcode.com/problems/unique-paths/)\n- [ ] [Jump Game](https://leetcode.com/problems/jump-game/)\n\n---\n\n## Graph\n\n- [ ] [Clone Graph](https://leetcode.com/problems/clone-graph/)\n- [ ] [Course Schedule](https://leetcode.com/problems/course-schedule/)\n- [ ] [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n- [ ] [Number of Islands](https://leetcode.com/problems/number-of-islands/)\n- [ ] [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)\n- [ ] [Alien Dictionary (Leetcode Premium)](https://leetcode.com/problems/alien-dictionary/)\n- [ ] [Graph Valid Tree (Leetcode Premium)](https://leetcode.com/problems/graph-valid-tree/)\n- [ ] [Number of Connected Components in an Undirected Graph (Leetcode Premium)](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)\n\n---\n\n## Heap\n\n- [ ] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)\n- [ ] [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)\n- [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)\n\n## Credit\n\n[Blind - Curated List of Top 75 LeetCode Questions to Save Your Time](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU)\n\n## Important Links\n\n- [FAANG Coding Interview Question](https://github.com/ombharatiya/FAANG-Coding-Interview-Questions)\n\n- [Data Structures and Sorting Cheat Sheet](https://docs.google.com/document/d/1PMoL1xJ9xa6ywQQ8HCc1oxLf2TUCiCaKaatlKYv6RZw/mobilebasic)\n\n- [14 Patterns to Ace Any Coding Interview Question](https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed)\n\n- [A to Z Learning Resources for Students by Deepak](https://github.com/ombharatiya/A-to-Z-Resources-for-Students)\n\n- [Competitive Programmer’s Handbook](https://cses.fi/book/book.pdf)\n\n- [Low Level Design Primer](https://github.com/prasadgujar/low-level-design-primer/blob/master/solutions.md)\n\n## About The Author\n\n- [Om Bharatiya](https://twitter.com/ombharatiya)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkzamanbd%2Fleetcode-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkzamanbd%2Fleetcode-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkzamanbd%2Fleetcode-problem/lists"}