Hash Table - Michael's Blog

Hash Table

A collection of 10 posts

Minimum Window Substring

76. Minimum Window Substring [https://leetcode.com/problems/minimum-window-substring/] LintCode-32.Minimum Window Substring [http://www.lintcode.com/en/problem/minimum-window-substring/] Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC"

Brick Wall

554. Brick Wall [https://leetcode.com/problems/brick-wall/] There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the bottom and

Strobogrammatic Number

246. Strobogrammatic Number [https://leetcode.com/problems/strobogrammatic-number/description/] A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Write a function to determine if a number is strobogrammatic. The number is represented as a string. For example, the numbers "69", "88"

Rearrange String k Distance Apart

358. Rearrange String k Distance Apart [https://leetcode.com/problems/rearrange-string-k-distance-apart/] Given a non-empty string s and an integer k, rearrange the string such that the same characters are at least distance k from each other. All input strings are given in lowercase letters. If it is not possible to

Find All Anagrams in a String

438. Find All Anagrams in a String [https://leetcode.com/problems/find-all-anagrams-in-a-string/] Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and p will not be

Binary Tree Vertical Order Traversal

314. Binary Tree Vertical Order Traversal [https://leetcode.com/problems/binary-tree-vertical-order-traversal] Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the same row and column, the order should be from left to right.

Valid Sudoku

36. Valid Sudoku [https://leetcode.com/problems/valid-sudoku/] Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. Note: A valid Sudoku board (partially filled) is not necessarily solvable. Only

Max Points on a Line

LintCode-186.Max Points on a Line [http://www.lintcode.com/en/problem/max-points-on-a-line/] > Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. > Example > Given 4 points: (1,2), (3,6), (0,0), (1,3). > The maximum number is 3.

Subarray Sum

LintCode-138.Subarray Sum [http://www.lintcode.com/en/problem/subarray-sum/] > Given an integer array, find a subarray where the sum of numbers is zero. Your code should return the index of the first number and the index of the last number. > Notice: There is at least one subarray that it's

Anagrams

LintCode-171.Anagrams [http://www.lintcode.com/en/problem/anagrams/] > Given an array of strings, return all groups of strings that are anagrams. > Notice: All inputs will be in lower-case. > Example > Given ["lint", "intl", "inlt", "code"], return ["lint", "inlt", "intl"]. > Given ["ab", "ba", "cd", "dc", "e"], return ["ab", "ba", "cd", "dc"