学海无涯

摘要： Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. 阅读全文

摘要： Given two binary strings, return their sum (also a binary string). 阅读全文

摘要： Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number 0 itself. The digits are stored such that the most significant digit is at the head of the list. 阅读全文

摘要： Validate if a given string is numeric. 阅读全文

摘要： 海量数据即是指数据量特别大，导致的问题就是要么在短时间内无法解决，要么是无法一次性装入内存。 解决办法有： * 针对时间问题：可以利用巧妙的算法和合适的数据结构，如hash/堆/bit-map/trie树等 * 针对空间问题：采用大而化小，分而治之/hash映射，把大规模转换为小规模的。各个击破 阅读全文

摘要： 写在前面的话，本来看网上的面经就一直有关于哈希表的问题，再加之实验室同学头条面试的时候让实现一个unordered_map，本来已经把对哈希表的总结和实现提上日程了。奈何太懒，一天拖一天，直到自己面阿里的时候被面试官在哈希表上翻来覆去蹂躏的时候，真的是不得不感叹一句，活该！！！ 阅读全文

摘要： 阿里实习面试的最后一个开放性问题：在浏览器输入一个网址回车后，发生了什么？ 阅读全文

摘要： 下午连着面了阿里爸爸的二面和三面，非常不明白别人的三面都是hr了，为什么我还是在技术面，那道面了个假阿里。不管怎么样，来篇面经攒攒人品。 阅读全文

摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time. 阅读全文

摘要： Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid. 阅读全文