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-k-sorted-lists | |
| // | |
| // Time: O(N log k) | |
| // Space: O(k) | |
| // | |
| // k = len(lists) | |
| // N = total number of nodes across all lists | |
| // .................... // |
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/add-two-numbers/ | |
| // | |
| // Time: O(N) | |
| // Space: O(N) | |
| // | |
| // N = number of nodes in the longer list | |
| // .................... // | |
| /** |
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/reverse-linked-list/ | |
| // | |
| // Time: O(N) | |
| // Space: O(1) | |
| // | |
| // N = number of nodes in the list | |
| // .................... // | |
| /** |
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/search-a-2d-matrix/ | |
| // | |
| // Time: O(log(m*n)) | |
| // Space: O(1) | |
| // | |
| // m = number of rows | |
| // n = number of columns | |
| // .................... // |
rtsoy
/ search-in-rotated-sorted-array.go
Last active
January 1, 2026 15:22
33. Search in Rotated Sorted Array
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/search-in-rotated-sorted-array/ | |
| // | |
| // Time: O(log n) | |
| // Space: O(1) | |
| // | |
| // n = number of elements in the array | |
| // .................... // | |
| func search(nums []int, target int) int { |
rtsoy
/ search-in-rotated-sorted-array-ii.go
Last active
January 1, 2026 17:22
81. Search in Rotated Sorted Array II
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/search-in-rotated-sorted-array-ii/ | |
| // | |
| // Time: O(log n) average | |
| // Space: O(1) | |
| // | |
| // n = number of elements in the array | |
| // .................... // | |
| func search(nums []int, target int) bool { |
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/single-number/ | |
| // | |
| // Time: O(n) | |
| // Space: O(1) | |
| // | |
| // n - number of elements in array | |
| // .................... // | |
| func singleNumber(nums []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/4sum/ | |
| // | |
| // Time: O(n^3) | |
| // Space: O(1) | |
| // | |
| // n = number of elements in array | |
| // .................... // | |
| func fourSum(nums []int, target int) [][]int { |
rtsoy
/ find-all-anagrams-in-a-string.go
Created
January 2, 2026 08:46
438. Find All Anagrams in a String
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/find-all-anagrams-in-a-string/ | |
| // | |
| // Time: O(n) | |
| // Space: O(1) | |
| // | |
| // n - number of elements in array | |
| // .................... // | |
| func findAnagrams(s string, p string) []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/number-of-islands/ | |
| // | |
| // Time: O(n*m) | |
| // Space: O(n*m) | |
| // | |
| // n = number of rows, m = number of columns | |
| // .................... // | |
| func numIslands(grid [][]byte) int { |
OlderNewer