Stats
Alexa Rank:
Popular in Country:
Country Alexa Rank:
language:
Response Time:
SSL: Disable
Status: up
Code To Txt Ratio
Word Count
Links
ratio
Leetcode
Uber 面经 https://www.1point3acres.com/bbs/thread-490045-1-1.html 第一轮: 面经题, 给起始和终点时间,按月输出中间的时间段,比如给定范围 [2019-01-10, 2019-03-15], 输出 -> [2019-01-10, 2019-01-31], [2019-02-01, 2019-02-28], [2019-03-01, 2019-03-15] 要考虑不同年月份的,个人觉得有时间还是提前写写吧,各种cases挺多的 先算出头跟尾,中间的就好解决了 第二轮: 韩国大叔,给一个un sorted array,里面数unique,找出所有两两和相等的pairs, 比如[9, 4, 3, 1, 7, 12] 返回:[1, 12] & [4, 9], [3, 7]. & [1, 9], [4, 12] & [7, 9] 卡住了,最后只好暴力解,卒 暴力找出n^2, 然后map存 sum -> pairs 第三轮:...
Han Zhu's Study Notes
Han Zhu's Study Notes. Mind nodes, path-finding algorithms, and random garbage collections of a computer science student.
今際の国の呵呵君
Monday, January 21, 2019 [LeetCode]Subsets II Read more » Posted by 今際の国の呵呵君 at 8:57 PM No comments: Email ThisBlogThis!Share to TwitterShare to FacebookShare to Pinterest Labels: dfs, leetcode Location: Newark, CA 94560, USA [LeetCode]Subsets Read more » Posted by 今際の国の呵呵君 at 8:54 PM No comments: Email ThisBlogThis!Share to TwitterShare to...
Lisa Tech Blog | My security road
Post navigation ← Older posts [Leetcode C++] Roman to Integer Posted on June 25, 2017 by admin Reply Problem Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. Analysis We traverse the string and add up each char...
LintCode 炼码
Powerful coding training system. LintCode has the most interview problems covering Google, Facebook, Linkedin, Amazon, Microsoft and so on. We provide Chinese and English versions for coders around the world.