摘要:
This question is about implementing a basic elimination algorithm for Candy Crush. Given a 2D integer array board representing the grid of candy, diff 阅读全文
摘要:
Given a set of words (without duplicates), find all word squares you can build from them. A sequence of words forms a valid word square if the kth row 阅读全文
摘要:
Welcome to my ‘how to implement a search engine’ series. I describe how to implement an actual search engine with working code in python. Here you can 阅读全文
摘要:
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
摘要:
Given a time represented in the format "HH:MM", form the next closest time by reusing the current digits. There is no limit on how many times a digit 阅读全文
摘要:
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文