122 - 算法题 Max and Min with Limited Comparisons - max-and-min-with-limited-comparisons.txt

Hi, here's your problem today. This problem was recently asked by Microsoft:

Given a list of numbers of size n, where n is greater than 3, find the maximum and minimum of the list using less than 2 * (n - 1) comparisons.

Here's a start:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 74003 次阅读, 49506 次搜索 | 58 个单词

123 - 算法题 Symmetric k-ary Tree - symmetric-k-ary-tree.txt

Hi, here's your problem today. This problem was recently asked by Microsoft:

A k-ary tree is a tree with k-children, and a tree is symmetrical if the data of the left side of the tree is the same as the right side of the tree.

Here's an example of a symmetrical k-ary tree.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 75750 次阅读, 31542 次搜索 | 118 个单词

124 - 算法题 H-Index - h-index.txt

Hi, here's your problem today. This problem was recently asked by Amazon:

The h-index is a metric that attempts to measure the productivity and citation impact of the publication of a scholar. The definition of the h-index is if a scholar has at least h of their papers cited h times.

Given a list of publications of the number of citations a scholar has, find their h-index.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 78095 次阅读, 31376 次搜索 | 98 个单词

125 - IT/互联网产业最好的十年：再见，2010年代！ - .txt

10年前，站在新十年的门槛上，我在我的blog上抄录了诗人食指的诗《相信未来》：

当蜘蛛网无情地查封了我的炉台，

当灰烬的余烟叹息着贫穷的悲哀，
...
阅读全文>>

Top | 类别: 新闻资讯 | 评论 (0) | 标签: IT/互联网产业, 最好的十年, Internet Companies, | 中文 | 88756 次阅读, 29595 次搜索 | 2037 个汉字

126 - Python才是世界上最好的语言 - python-is-the-best.txt

　　不同的编程有不同的应用场景和不同的使用场合，因此无法全面的评论哪种语言是最好的。但是各种不同的媒介还是每隔一段时间都会发布编程语言的热度排行榜。前不久电气和电子工程师协会（ IEEE）发布了顶级编程语言交互排行榜。Python超越Java高居首位。

　　为什么Python在IEEE Spectrum的调查里面这么受欢迎呢？

　　一个原因就是Python现在已经逐渐受到嵌入式的支持。放在以前，受到嵌入式硬件的限制，一般只能支持一些编译语言。但是现在随着嵌入式硬件变得越来越强大，他的硬件能力足以支撑起Python的运行。而Python对于一些特定的嵌入式应用场景可以非常简单、方便、快速的搭建起可运行系统。因此，Python现在在嵌入式圈子里逐渐得到应用并且火了起来。
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: Python, 最好的语言, Python, | 中文 | 87052 次阅读, 35505 次搜索 | 1084 个汉字

127 - 每日算法题 Jump to the End - jump-to-the-end.txt

Hi, here's your problem today. This problem was recently asked by Facebook:

Starting at index 0, for an element n at index i, you are allowed to jump at most n indexes ahead. Given a list of numbers, find the minimum number of jumps to reach the end of the list.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 78176 次阅读, 29921 次搜索 | 86 个单词

128 - 每日算法题 Circle of Chained Words - circle-of-chained-words.txt

Hi, here's your problem today. This problem was recently asked by Facebook:

Two words can be 'chained' if the last character of the first word is the same as the first character of the second word.

Given a list of words, determine if there is a way to 'chain' all the words in a circle.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 78684 次阅读, 31197 次搜索 | 107 个单词

129 - 每日算法题 Decode String - decode-string.txt.txt

Hi, here's your problem today. This problem was recently asked by Google:

Given a string with a certain rule: k[string] should be expanded to string k times. So for example, 3[abc] should be expanded to abcabcabc. Nested expansions can happen, so 2[a2[b]c] should be expanded to abbcabbc.

Your starting point:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 78024 次阅读, 26406 次搜索 | 67 个单词

130 - 每日算法题 Full Binary Tree - full-binary-tree.txt

Hi, here's your problem today. This problem was recently asked by Google:

Given a binary tree, remove the nodes in which there is only 1 child, so that the binary tree is a full binary tree.

So leaf nodes with no children should be kept, and nodes with 2 children should be kept as well.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 80026 次阅读, 27779 次搜索 | 171 个单词

131 - 每日算法题 Min Stack - min-stack.txt

Hi, here's your problem today. This problem was recently asked by Uber:

Design a simple stack that supports push, pop, top, and retrieving the minimum element in constant time.

push(x) -- Push element x onto stack.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 79477 次阅读, 25977 次搜索 | 137 个单词

132 - 每日算法题 Reverse Integer - reverse-integer.txt

Hi, here's your problem today. This problem was recently asked by LinkedIn:

Write a function that reverses the digits a 32-bit signed integer, x. Assume that the environment can only store integers within the 32-bit signed integer range, [-2^31, 2^31 - 1]. The function returns 0 when the reversed integer overflows.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 79380 次阅读, 25332 次搜索 | 70 个单词