Design - Michael's Blog

Design

A collection of 4 posts

Implement Trie (Prefix Tree)

208. Implement Trie (Prefix Tree) [https://leetcode.com/problems/implement-trie-prefix-tree/] LintCode-442.Implement Trie [http://www.lintcode.com/en/problem/implement-trie/] Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. class TrieNode { private var children: [TrieNode?] = [] public var

Add and Search Word

211. Add and Search Word - Data structure design [https://leetcode.com/problems/add-and-search-word-data-structure-design/] LintCode-473.Add and Search Word [http://www.lintcode.com/en/problem/add-and-search-word/] Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or

Moving Average from Data Stream

346. Moving Average from Data Stream [https://leetcode.com/problems/moving-average-from-data-stream/] Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. For example, MovingAverage m = new MovingAverage(3); m.next(1) = 1 m.next(10) = (1 + 10) / 2 m.next(

Zigzag Iterator

281. Zigzag Iterator [https://leetcode.com/problems/zigzag-iterator/] Given two 1d vectors, implement an iterator to return their elements alternately. For example, given two 1d vectors: v1 = [1, 2] v2 = [3, 4, 5, 6] By calling next repeatedly until hasNext returns false, the order of elements returned by next should