vinbrule

import AppKit
import PlaygroundSupport
import WebKit
var webView: WKWebView!
webView = WKWebView(frame: CGRect(x: 0, y: 0, width: 600, height: 800.0))


var filePath = URL.init(fileURLWithPath: "/Users/van/Downloads/firefox/01-interview preparation/leetcode/facebook/Longest Substring Without Repeating Characters - LeetCode Articles.webarchive")
print(filePath)
let fileDirectoryURL = filePath.deletingLastPathComponent()

vinbrule

https://github.com/Open-Web-Analytics/Open-Web-Analytics
https://matomo.org/
https://github.com/matomo-org/matomo
https://github.com/usefathom/fathom
https://www.goatcounter.com/
https://plausible.io/
https://github.com/PostHog/posthog
https://www.usertrack.net/
	

vinbrule

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/

vinbrule

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/