This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/top-k-frequent-words/ | |
| // | |
| // Time: O(n log k) | |
| // Space: O(n) | |
| // | |
| // n = number of unique words in array | |
| // .................... // | |
| type item struct { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/top-k-frequent-elements/ | |
| // | |
| // Time: O(n log k) | |
| // Space: O(n) | |
| // | |
| // n - number of unique elements in array | |
| // .................... // | |
| type item struct { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/merge-intervals/ | |
| // | |
| // Time: O(n log n) | |
| // Space: O(n) | |
| // | |
| // n = number of intervals | |
| // .................... // | |
| func merge(intervals [][]int) [][]int { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/container-with-most-water/ | |
| // | |
| // Time: O(n) | |
| // Space: O(1) | |
| // | |
| // n = number of elements in array | |
| // .................... // | |
| func maxArea(height []int) int { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/partition-labels/ | |
| // | |
| // Time: O(n) | |
| // Space: O(1) | |
| // | |
| // n = number of letters in string | |
| // .................... // | |
| func partitionLabels(s string) []int { |
rtsoy
/ longest-repeating-character-replacement.go
Created
January 5, 2026 18:23
424. Longest Repeating Character Replacement
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/longest-repeating-character-replacement/ | |
| // | |
| // Time: O(n) | |
| // Space: O(1) | |
| // | |
| // n = number of letters in string | |
| // .................... // | |
| func characterReplacement(s string, k int) int { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // https://leetcode.com/problems/sliding-window-maximum | |
| // | |
| // Time: O(n) | |
| // Space: O(n) | |
| // | |
| // n = number of elements in array | |
| // .................... // | |
| func maxSlidingWindow(nums []int, k int) []int { |
OlderNewer