Keep walking

摘要： Given two sparse matrices A and B, return the result of AB. You may assume that A's column number is equal to B's row number. Example: 阅读全文

摘要： Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference room 阅读全文

摘要： Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". 阅读全文

摘要： Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may cont 阅读全文

摘要： Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could 阅读全文

摘要： I have read many posts on SO and the web regarding the keywords in my question title and learned a lot from them. Some of the questions I read are rel 阅读全文

摘要： Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文

摘要： Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2. Your algorithm s 阅读全文

摘要： In a nutshell, ZooKeeper helps you build distributed applications. How it works You may describe ZooKeeper as a replicated synchronization service wit 阅读全文

摘要： Kafka in a Nutshell Posted on September 25, 2015 • kafka Kafka in a Nutshell Posted on September 25, 2015 • kafka Kafka in a Nutshell Posted on Septem 阅读全文