{"id":30119892,"url":"https://github.com/suprio-das/top-300-leetcode-problems","last_synced_at":"2025-08-10T12:51:42.766Z","repository":{"id":287187088,"uuid":"963890152","full_name":"Suprio-Das/Top-300-LeetCode-Problems","owner":"Suprio-Das","description":"In this repository I will keep the top 300 LeetCode problems that I have solved. I will keep all the solved problems here topic wise. I will try to solve problems every day and update here.","archived":false,"fork":false,"pushed_at":"2025-04-17T20:03:07.000Z","size":50,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-18T06:48:37.443Z","etag":null,"topics":["algorithms","dsa","dynamic-programming","leetcode-cpp","problem-solving"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Suprio-Das.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":"2025-04-10T11:17:07.000Z","updated_at":"2025-04-17T20:03:10.000Z","dependencies_parsed_at":"2025-04-10T12:51:08.588Z","dependency_job_id":"7aa11784-dead-4787-b467-58b9556f5bca","html_url":"https://github.com/Suprio-Das/Top-300-LeetCode-Problems","commit_stats":null,"previous_names":["suprio-das/top-300-leetcode-problems"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Suprio-Das/Top-300-LeetCode-Problems","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Suprio-Das%2FTop-300-LeetCode-Problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Suprio-Das%2FTop-300-LeetCode-Problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Suprio-Das%2FTop-300-LeetCode-Problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Suprio-Das%2FTop-300-LeetCode-Problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Suprio-Das","download_url":"https://codeload.github.com/Suprio-Das/Top-300-LeetCode-Problems/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Suprio-Das%2FTop-300-LeetCode-Problems/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269727088,"owners_count":24465397,"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","status":"online","status_checked_at":"2025-08-10T02:00:08.965Z","response_time":71,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithms","dsa","dynamic-programming","leetcode-cpp","problem-solving"],"created_at":"2025-08-10T12:51:41.942Z","updated_at":"2025-08-10T12:51:42.698Z","avatar_url":"https://github.com/Suprio-Das.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Top 300 LeetCode Problems Solving\n\n\u003cp style=\"text-align: justify; font-family: Verdana\"\u003e\nIn this repository I will keep the top 300 LeetCode problems that I have solved in LeetCode. I will keep all the solved problems here topicwise. I will try to solve problems every day and update here.\n\u003c/p\u003e\n\n## 📘 Problem List\n\n### 🔹 Array\n\n#### 🟢 Problem 01: [Moving Zeroes](https://leetcode.com/problems/move-zeroes/)\n**Description:**  \nGiven an integer array `nums`, move all `0`'s to the end while maintaining the relative order of the non-zero elements.  \n**Note:** You must do this **in-place** without making a copy of the array.\n\n#### 🟢 Problem 02: [Majority Elements](https://leetcode.com/problems/majority-element/)\n**Description:**  \nGiven an array `nums` of size `n`, return the majority element. \u003cbr\u003e\nThe majority element is the element that appears more than `⌊n / 2⌋` times. You may assume that the majority element always exists in the array. \u003cbr\u003e\nFollow-up: Could you solve the problem in linear time and in `O(1)` space? \u003cbr\u003e\n`This problem is solved by Boyer-Moore voting algorithm`\n\n#### 🟢 Problem 03: [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)\n**Description:**  \nGiven an integer array `nums` sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in `nums`.\n\n#### 🟢 Problem 04: [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)\n**Description:**  \nYou are given an array `prices` where `prices[i]` is the price of a given stock on the ith day.\nYou want to maximize your `profit` by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.\u003cbr\u003e\n\nReturn the maximum `profit` you can achieve from this transaction. If you cannot achieve any `profit`, return `0`.\n\n#### 🟢 Problem 05: [Rotate Array](https://leetcode.com/problems/rotate-array/description/)\n**Description:**  \nGiven an integer array `nums`, rotate the array to the right by `k` steps, where `k` is non-negative.\n\n---\n\n### 🔹 Two Pointer\n\n#### 🟢 Problem 01: [Two Sum](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)\n**Description:**  \nGiven a `1-indexed` array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers `[index1]` and numbers `[index2]` where `1 \u003c= index1 \u003c index2 \u003c= numbers.length`.\n\nReturn the indices of the two numbers, `index1` and `index2`, added by one as an integer array `[index1, index2]` of length `2`.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsuprio-das%2Ftop-300-leetcode-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsuprio-das%2Ftop-300-leetcode-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsuprio-das%2Ftop-300-leetcode-problems/lists"}