forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
12 changed files
with
257 additions
and
9 deletions.
There are no files selected for viewing
This file contains 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
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,51 @@ | ||
| /* | ||
| Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every | ||
| character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". | ||
| Space: O(1) | ||
| Time: O(n+m) where n is the length of s and m the length of t | ||
| */ | ||
|
|
||
| char * minWindow(char * s, char * t){ | ||
| int alpha[59] = {0}; | ||
| int need = 0; | ||
| for (int i=0; t[i]!='\0'; i++) { // Initialise the alphabet | ||
| if (alpha[t[i]-'A']==0) | ||
| need++; | ||
| alpha[t[i]-'A']--; | ||
| } | ||
| int maxLen = 100001; | ||
| int pos=0; | ||
| int i=0, j=0; | ||
| while (s[j]!='\0') { | ||
| alpha[s[j]-'A']++; | ||
| if (alpha[s[j]-'A']==0) { | ||
| need--; | ||
| if (need==0) { | ||
| while (alpha[s[i]-'A']>0) { | ||
| alpha[s[i]-'A']--; | ||
| i++; | ||
| } | ||
| if ((j-i+1)<maxLen) { | ||
| pos = i; | ||
| maxLen = j-i+1; | ||
| } | ||
| alpha[s[i]-'A']--; | ||
| need++; | ||
| i++; | ||
| } | ||
| } | ||
| j++; | ||
| } | ||
|
|
||
| if (maxLen==100001) { // No substring found | ||
| char* ans = malloc(sizeof(char)); | ||
| ans[0] = '\0'; | ||
| return ans; | ||
| } else { | ||
| char* ans = malloc(sizeof(char)*(maxLen+1)); | ||
| for (int i=0; i<maxLen; i++) | ||
| ans[i] = s[i+pos]; | ||
| ans[maxLen] = '\0'; | ||
| return ans; | ||
| } | ||
| } |
This file contains 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
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,44 @@ | ||
| public class Solution | ||
| { | ||
| public int[] MinInterval(int[][] intervals, int[] queries) | ||
| { | ||
|
|
||
| var q = queries.Length; | ||
| var indexDict = new int[q][]; | ||
| var index = 0; | ||
| foreach (var query in queries) | ||
| { | ||
| indexDict[index] = new int[2] { query, index }; | ||
| index++; | ||
| } | ||
| Array.Sort(indexDict, (a, b) => a[0] - b[0]); | ||
| Array.Sort(intervals, (a, b) => a[0] - b[0]); | ||
|
|
||
| var pq = new PriorityQueue<int[], int>(); | ||
| var result = new int[queries.Length]; | ||
|
|
||
| index = 0; | ||
| foreach (var query in indexDict) | ||
| { | ||
| var resultIndex = query; | ||
| var calResult = -1; | ||
|
|
||
| while (index < intervals.Length && intervals[index][0] <= resultIndex[0]) | ||
| { | ||
| var curr = intervals[index]; | ||
| pq.Enqueue(new int[2] { curr[1] - curr[0] + 1, curr[1] }, curr[1] - curr[0] + 1); | ||
| index++; | ||
| } | ||
|
|
||
| while (pq.Count > 0 && pq.Peek()[1] < resultIndex[0]) | ||
| { | ||
| pq.Dequeue(); | ||
| } | ||
| calResult = pq.Count > 0 ? pq.Peek()[0] : -1; | ||
| result[resultIndex[1]] = calResult; | ||
| } | ||
|
|
||
| return result; | ||
|
|
||
| } | ||
| } |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,26 @@ | ||
| public class Solution | ||
| { | ||
| public IList<IList<int>> Permute(int[] nums) | ||
| { | ||
| var result = new List<IList<int>>(); | ||
| PermuteRecurse(result, nums, 0); | ||
| return result; | ||
| } | ||
|
|
||
| private void PermuteRecurse(List<IList<int>> res, int[] arr, int start) | ||
| { | ||
| if (start == arr.Length) | ||
| { | ||
| var list = arr.Select(t => (t)).ToList(); | ||
| res.Add(list); | ||
| return; | ||
| } | ||
|
|
||
| for (var i = start; i < arr.Length; i++) | ||
| { | ||
| (arr[start], arr[i]) = (arr[i], arr[start]); | ||
| PermuteRecurse(res, arr, start + 1); | ||
| (arr[start], arr[i]) = (arr[i], arr[start]); | ||
| } | ||
| } | ||
| } |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -15,6 +15,4 @@ int dfs(int index, int total){ | |
| return mem[(index, total)]; | ||
| } | ||
|
|
||
| return dfs(0,0); | ||
| } | ||
| } | ||
| return dfs(0,0); | ||
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,22 @@ | ||
| func kthSmallest(root *TreeNode, k int) int { | ||
| stack := make([]*TreeNode, 0, k) | ||
|
|
||
| for { | ||
| for root != nil { | ||
| stack = append(stack, root) | ||
| root = root.Left | ||
| } | ||
|
|
||
| root = stack[len(stack) - 1] | ||
| stack = stack[:len(stack) - 1] | ||
|
|
||
| k-- | ||
| if k == 0 { | ||
| return root.Val | ||
| } | ||
|
|
||
| root = root.Right | ||
| } | ||
|
|
||
| return -1 | ||
| } |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,19 @@ | ||
| func isValidBST(root *TreeNode) bool { | ||
| return isValid(root, nil, nil) | ||
| } | ||
|
|
||
| func isValid(root, min, max *TreeNode) bool { | ||
| if root == nil { | ||
| return true | ||
| } | ||
|
|
||
| if min != nil && root.Val <= min.Val { | ||
| return false | ||
| } | ||
|
|
||
| if max != nil && root.Val >= max.Val { | ||
| return false | ||
| } | ||
|
|
||
| return isValid(root.Left, min, root) && isValid(root.Right, root, max) | ||
| } |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,41 @@ | ||
| class Solution { | ||
| fun longestIncreasingPath(matrix: Array<IntArray>): Int { | ||
| val m = matrix.size | ||
| val n = matrix[0].size | ||
| val memo = Array<IntArray>(m){IntArray(n)} | ||
| val dirs = arrayOf(intArrayOf(-1,0),intArrayOf(1,0),intArrayOf(0,1),intArrayOf(0,-1)) | ||
| var res = 1 | ||
|
|
||
| for (i in 0..m-1) { | ||
| for (j in 0..n-1) { | ||
| val len = dfs(matrix, i, j, dirs, memo) | ||
| res = Math.max(res, len) | ||
| } | ||
| } | ||
|
|
||
| return res | ||
| } | ||
|
|
||
| fun dfs(matrix: Array<IntArray>, row: Int, col: Int, dirs: Array<IntArray>, memo: Array<IntArray>): Int { | ||
| val m = matrix.size | ||
| val n = matrix[0].size | ||
|
|
||
| if (memo[row][col] != 0) | ||
| return memo[row][col] | ||
|
|
||
| var len = 1 | ||
|
|
||
| for (dir in dirs) { | ||
| val x = dir[0] + row | ||
| val y = dir[1] + col | ||
|
|
||
| if (x < 0 || x == m || y < 0 || y == n || matrix[row][col] >= matrix[x][y]) | ||
| continue | ||
|
|
||
| len = Math.max(len, 1+dfs(matrix, x, y, dirs, memo)) | ||
| } | ||
|
|
||
| memo[row][col] = len | ||
| return len | ||
| } | ||
| } |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,17 +1,17 @@ | ||
| class Solution: | ||
| def minEatingSpeed(self, piles: List[int], h: int) -> int: | ||
| l, r = 1, max(piles) | ||
| k = 0 | ||
| res = max(piles) | ||
|
|
||
| while l <= r: | ||
| m = (l + r) // 2 | ||
| k = (l + r) // 2 | ||
|
|
||
| totalTime = 0 | ||
| for p in piles: | ||
| totalTime += ((p - 1) // m) + 1 | ||
| totalTime += math.ceil(p / k) | ||
| if totalTime <= h: | ||
| k = m | ||
| res = min(res, k) | ||
| r = m - 1 | ||
| else: | ||
| l = m + 1 | ||
| return k | ||
| return res |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,13 @@ | ||
| def max_sub_array(nums) | ||
| sum = 0 | ||
| max = -10 * 10 * 10 * 10 - 1 | ||
|
|
||
| nums.each do |num| | ||
| sum += num | ||
| max = sum > max ? sum : max | ||
|
|
||
| sum = 0 if sum < 0 | ||
| end | ||
|
|
||
| max | ||
| end |
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,33 @@ | ||
| $MAP = { | ||
| 2 => %w(a b c), | ||
| 3 => %w(d e f), | ||
| 4 => %w(g h i), | ||
| 5 => %w(j k l), | ||
| 6 => %w(m n o), | ||
| 7 => %w(p q r s), | ||
| 8 => %w(t u v), | ||
| 9 => %w(w x y z) | ||
| } | ||
|
|
||
| # @param {String} digits | ||
| # @return {String[]} | ||
| def letter_combinations(digits) | ||
| ans = [] | ||
|
|
||
| recurse(digits, "", ans, 0) unless digits.empty? | ||
|
|
||
| ans | ||
| end | ||
|
|
||
| def recurse(digits, prefix, ans, i) | ||
| if digits.length == prefix.length | ||
| ans << prefix | ||
| return | ||
| end | ||
|
|
||
| digit = digits[i].to_i | ||
|
|
||
| $MAP[digit].each do |c| | ||
| recurse(digits, prefix + c, ans, i + 1) | ||
| end | ||
| end |