121 - Algorithm Interview Question: Nth Fibonacci Number - nth-fibonacci-number.txt

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

The Fibonacci sequence is the integer sequence defined by the recurrence relation: F(n) = F(n-1) + F(n-2), where F(0) = 0 and F(1) = 1. In other words, the nth Fibonacci number is the sum of the prior two Fibonacci numbers. Below are the first few values of the sequence:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 73984 Views, 31460 Search Bots | 97 Words

122 - Algorithm Interview Question: 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:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 74005 Views, 49506 Search Bots | 58 Words

123 - Algorithm Interview Question: 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.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 75755 Views, 31544 Search Bots | 118 Words

124 - Algorithm Interview Question: 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.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 78106 Views, 31378 Search Bots | 98 Words

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

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

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

当灰烬的余烟叹息着贫穷的悲哀，
...
Full Text>>

Top | Category: News | Comments (0) | Tags: IT/互联网产业, 最好的十年, Internet Companies, | 中文 | 88761 Views, 29595 Search Bots | 2037 Characters

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

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

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

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

Top | Category: Computing | Comments (0) | Tags: Python, 最好的语言, Python, | 中文 | 87057 Views, 35506 Search Bots | 1084 Characters

127 - Daily Interview Problem: 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:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 78178 Views, 29922 Search Bots | 86 Words

128 - Daily Interview Problem: 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.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 78686 Views, 31201 Search Bots | 107 Words