Will the Guru

  • Counting the number of subarrays

    문제들 중, 특정 조건을 부합하는 subarray의 갯수를 구하는 문제 유형이 있다. 예를 들어, subarray 의 합이 k 가 되는 subarray 의 갯수를 구하라는 문제가 있다면, 이는 prefixSum + hashmap 을 통해 풀 수 있다! Problem https://leetcode.com/problems/subarray-sum-equals-k/description/ Solution Reference Read more

  •  Minimum Value to Get Positive Step by Step Sum

    Problem https://leetcode.com/explore/interview/card/leetcodes-interview-crash-course-data-structures-and-algorithms/703/arraystrings/4657/ Solution Read more

  • Prefix Sum

    Pseudo Code Reference Read more

  • Maximum Average Subarray I

    Problem https://leetcode.com/problems/maximum-average-subarray-i/description Solution Notes Read more

  • Max Consecutive Ones III

    Problem https://leetcode.com/problems/max-consecutive-ones-iii Solution Notes Read more

  • Sliding Window

    Pseudo Code – Moving two pointers dynamically Pseudo Code – Moving two pointers dynamically (Detailed Version) Pseudo Code – Fixed window size Reference Read more

Availability (2) Binary Search Tree (2) Consistency (2) Design Doc (1) DFS (3) Durability (2) Dynamic Programming (4) Graph (7) HashMap (3) Linked List (3) List (2) Monotonic (3) MSA (2) Performance (2) Prefix Sum (4) Rate Limiter (3) Replication (2) Scalability (3) Sliding Window (8) System Design (22) Thread (2) Trie (3) Two Pointers (3) Union-Find (6) WebSocket (2) ⭐️ (6) ⭐️⭐️ (4) ⭐️⭐️⭐️ (11) ⭐️⭐️⭐️⭐️ (24) ⭐️⭐️⭐️⭐️⭐️ (41)