RickyC0626

{
  "A0": 27.50000,
  "A#0": 29.13524,
  "B0": 30.86771,
  "C1": 32.70320,
  "C#1": 34.64783,
  "D1": 36.70810,
  "D#1": 38.89087,
  "E1": 41.20344,
  "F1": 43.65353,

RickyC0626

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

Pattern: Sliding Window

• https://leetcode.com/problems/maximum-subarray/ # Close enough
• https://leetcode.com/problems/minimum-size-subarray-sum/

RickyC0626

PORT=4000

RickyC0626

// "webpack-dev-server": "^1.14.1"
// node_modules/webpack-dev-server/bin/webpack-dev-server.js

// line 58
.describe("port", "The port").default("port", 3000)