leetcode
leetcode copied to clipboard
tech-cow
👏🏻 leetcode solutions for Humans™
### 862. Shortest Subarray with Sum at Least K ```python ''' 思路参考：https://github.com/Shellbye/Shellbye.github.io/issues/41 Time: O(N^2) TLE Brute Force + preSum 思路： 在Brute Force的基础上，加入一个PreSum来记忆化记忆一下到i为止的和，方便与之后直接调用 注意的事项就是要给preSum多预留一个位置，和DP类似，用来处理一些edge case，比如array总长就一个 Input: A = [1], K =...
## 209. Minimum Size Subarray Sum [公瑾回来刷题咯](https://github.com/yuzhoujr/leetcode/issues/72)  ```python """ [start] 12:34 Problem Solving Thought Process: 1. Brute Force Using 2 for loops to find out 2 element that sums...
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are...
### Day 1 - Facebook DFS #### Medium * [ ] 301 [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses "Remove Invalid Parentheses") * [ ] 721 [Accounts Merge](https://leetcode.com/problems/accounts-merge "Accounts Merge") #### Hard * [...