LeetCode Solutions - walkccc.me
💡 Solutions to LeetCode in C++23, Java, Python, MySQL, and TypeScript. This repository aims to provide code with good readability and consistent style over various topics and embraces new standards.
1. Two Sum - LeetCode Solutions
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> numToIndex; for (int i = 0; i < nums.size(); ++i) { if (const auto it = numToIndex.find(target - nums[i]); …
49. Group Anagrams - LeetCode Solutions
class Solution: def groupAnagrams(self, strs: list[str]) -> list[list[str]]: dict = collections.defaultdict(list) for str in strs: key = ''.join(sorted(str)) dict[key].append(str) return dict.values()
75. Sort Colors - LeetCode Solutions
class Solution { public: void sortColors(vector<int>& nums) { int l = 0; int r = nums.size() - 1; for (int i = 0; i <= r;) if (nums[i] == 0) swap(nums[i++], nums[l++]); else if (nums[i] == 1) ++i; else swap(nums[i], …
46. Permutations - LeetCode Solutions
class Solution { public: vector<vector<int>> permute(vector<int>& nums) { vector<vector<int>> ans; dfs(nums, vector<bool>(nums.size()), {}, ans); return ans; } private: void dfs(const vector<int>& …
35. Search Insert Position - LeetCode Solutions
class Solution { public: int searchInsert(vector<int>& nums, int target) { int l = 0; int r = nums.size(); while (l < r) { const int m = (l + r) / 2; if (nums[m] == target) return m; if (nums[m] < target) l = m + 1; else r = …
169. Majority Element - LeetCode Solutions
class Solution { public: int majorityElement(vector<int>& nums) { int ans; int count = 0; for (const int num : nums) { if (count == 0) ans = num; count += num == ans ? 1 : -1; } return ans; } };
20. Valid Parentheses - LeetCode Solutions
class Solution { public: bool isValid(string s) { stack<char> stack; for (const char c : s) if (c == '(') stack.push(')'); else if (c == '{') stack.push('}'); else if (c == '[') stack.push(']'); else if (stack.empty() || …
66. Plus One - LeetCode Solutions
class Solution { public: vector<int> plusOne(vector<int>& digits) { for (int i = digits.size() - 1; i >= 0; --i) { if (digits[i] < 9) { ++digits[i]; return digits; } digits[i] = 0; } digits.insert(digits.begin(), 1); return digits; } };
88. Merge Sorted Array - LeetCode Solutions
class Solution: def merge(self, nums1: list[int], m: int, nums2: list[int], n: int) -> None: i = m - 1 # nums1's index (the actual nums) j = n - 1 # nums2's index k = m + n - 1 # nums1's index (the next filled …