2017年6月6日

摘要： https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Mock%20Interviews/Social%20Network%20Company/Social%2 阅读全文

posted @ 2017-06-06 21:35 Premiumlab 阅读(342) 评论(0) 推荐(0)

Unsorted, maximum ==> sorted

摘要： https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Mock%20Interviews/Social%20Network%20Company/Social%2 阅读全文

posted @ 2017-06-06 21:32 Premiumlab 阅读(167) 评论(0) 推荐(0)

Find one unique integer

摘要： https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Mock%20Interviews/Social%20Network%20Company/Social%2 阅读全文

posted @ 2017-06-06 21:29 Premiumlab 阅读(251) 评论(0) 推荐(0)

TwoSum

摘要： On-Site Question 1 - SOLUTION Problem Given a list of integers and a target number, write a function that returns a boolean indicating if its possible 阅读全文

posted @ 2017-06-06 21:24 Premiumlab 阅读(147) 评论(0) 推荐(0)

13. Roman to Integer

摘要： https://leetcode.com/problems/roman-to-integer/#/description Given a roman numeral, convert it to an integer. Input is guaranteed to be within the ran 阅读全文

posted @ 2017-06-06 21:18 Premiumlab 阅读(115) 评论(0) 推荐(0)

38. Count and Say - Unsolved

摘要： https://leetcode.com/problems/count-and-say/#/description The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 阅读全文

posted @ 2017-06-06 20:18 Premiumlab 阅读(136) 评论(0) 推荐(0)

543. Diameter of Binary Tree

摘要： https://leetcode.com/problems/diameter-of-binary-tree/#/description Given a binary tree, you need to compute the length of the diameter of the tree. T 阅读全文

posted @ 2017-06-06 15:30 Premiumlab 阅读(156) 评论(0) 推荐(0)

235. Lowest Common Ancestor of a Binary Search Tree

摘要： https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/#/description Given a binary search tree (BST), find the lowest common an 阅读全文

posted @ 2017-06-06 14:02 Premiumlab 阅读(159) 评论(0) 推荐(0)

252. Meeting Rooms

摘要： https://leetcode.com/problems/meeting-rooms/#/description Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2], 阅读全文

posted @ 2017-06-06 10:31 Premiumlab 阅读(219) 评论(0) 推荐(0)


博客园 © 2004-2026 浙公网安备 33010602011771号浙ICP备2021040463号-3

导航

2017年6月6日