Skip to content

Instantly share code, notes, and snippets.

class Node
{
Node[] children = new Node[26];
int count;
int end;
}
Here's ordinary Trie implementation with my comments. Feel free to ask questions.
class Trie
{
class TrieNode {
// R links to node children
private TrieNode[] links;
private final int R = 26;
private boolean isEnd;
public TrieNode() {
@Shubhashish777
Shubhashish777 / grokking_to_leetcode.md
Created May 29, 2022 12:15 — forked from tykurtz/grokking_to_leetcode.md
Grokking the coding interview equivalent leetcode problems

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