121 - 每日算法题: Look and Say Sequence - look-and-say-sequence.txt

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

A look-and-say sequence is defined as the integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. An example is easier to understand:

Each consecutive value describes the prior value.
...
阅读全文>>

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

122 - 每日算法题: Deepest Node in a Binary Tree - deepest-node-in-a-binary-tree.txt

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

You are given the root of a binary tree. Return the deepest node (the furthest node from the root).

Example:
...
阅读全文>>

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

123 - 每日算法题: Buddy Strings - buddy-strings.txt

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

Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.

Example 1:
...
阅读全文>>

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

124 - 每日算法题: Trapping Rainwater - tapping-rainwater.txt

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

You have a landscape, in which puddles can form. You are given an array of non-negative integers representing the elevation at each location. Return the amount of water that would accumulate if it rains.

For example: [0,1,0,2,1,0,1,3,2,1,2,1] should return 6 because 6 units of water can get trapped here.
...
阅读全文>>

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

125 - 每日算法题: Create a balanced binary search tree - create-a-balanced-binary-search-tree.txt

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

Given a sorted list of numbers, change it into a balanced binary search tree. You can assume there will be no duplicate numbers in the list.

Here's a starting point:
...
阅读全文>>

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

126 - 每日算法题: Merge K Sorted Linked Lists - merge-k-sorted-linked-list.txt

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

You are given an array of k sorted singly linked lists. Merge the linked lists into a single sorted linked list and return it.

Here's your starting point:
...
阅读全文>>

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

127 - 每日算法题: Contiguous Subarray with Maximum Sum - contiguous-subarray-with-maximum-sum.txt

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

You are given an array of integers. Find the maximum sum of all possible contiguous subarrays of the array.

Example:
...
阅读全文>>

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

128 - 网易认怂... - netease-says-sorry.txt

网易事件出结果了。网易基本上认怂，承认了被裁员工的说法，也承认自己裁员的做法简单粗暴，表示道歉并愿意进一步沟通补偿事宜。

简单介绍一下来龙去脉。

网易杭研所某游戏策划小哥工作5年，加班4000小时，长期劳累还得了心脏疾病。年初因业绩不佳被要求主动离职，但他不愿走。最终网易HR比较粗暴地开除了他，包括让保安采取强制措施等。从而引发了网络上广泛的支持和同情。
...
阅读全文>>

Top | 类别: 新闻资讯 | 评论 (0) | 标签: 网易, 认怂, Neteasy, apologizes, | 中文 | 482 次阅读, 16905 次搜索 | 1405 个汉字

129 - 婚后我每个月给娘家2000是不是不合适？ - send-money-to-parents.txt

提问：

我和我老公恋爱三年，结婚一年半，现在怀孕6个月。

我老公家情况是：拆迁户所以有两套自己的房子。他爸妈日子过得比较省，半辈子攒的几十万积蓄，用来给我们在杭州摇号买房当首付。（因为月租房子也是钱，摇号的房子相对性价比高。但是我们很佛系，房子摇不摇得到顺其自然吧。)
...
阅读全文>>

Top | 类别: 知识问答 | 评论 (0) | 标签: 婚后, 娘家, Sending Money, | 中文 | 433 次阅读, 15846 次搜索 | 2425 个汉字

130 - 被割韭菜的美股股民：“别买奇怪的中国公司股票！” - china-stocks.txt

与买中国公司股票的美股股民交谈，是一件颇为有趣的事情。

曾经有美股股民对硅星人提起自己投资的事儿，语气不无得意：“我买了阿里巴巴的股票”，大赚一笔；

也有另一名股民则问硅星人：“你有没有听说过瑞幸咖啡？听说这家公司很厉害，要挑战星巴克”。
...
阅读全文>>

Top | 类别: 新闻资讯 | 评论 (0) | 标签: 割韭菜, 美股股民, 中国公司股票, Chinese Stocks, | 中文 | 855 次阅读, 15839 次搜索 | 1886 个汉字

131 - 网易回应暴力裁员事件 - netease-reply.txt

　　25日，针对暴力裁员一事，网易公司回应称，确实存在简单粗暴、不近人情等诸多行为，向相关前同事及家人道歉。网易表示，接下来，将继续尝试和他进行积极有效的沟通，推进事件妥善处理，也愿意为这位前同事提供一切可行的援助。

　　以下为网易声明全文：

　　网易公司发布的说明
...
阅读全文>>

Top | 类别: 新闻资讯 | 评论 (0) | 标签: 控诉, 网易暴力, 裁员, Netease, 163, | 中文 | 846 次阅读, 16439 次搜索 | 2563 个汉字

132 - 员工控诉网易暴力裁员将患病员工赶出公司 - netease.txt

　　近日，一篇名为《网易裁员，让保安把身患绝症的我赶出公司，我在网易亲身经历的噩梦》的文章被广泛转发。作者在文章中称，自己是网易游戏的员工，身患扩张型心肌病。在职期间遇到了一系列不公正待遇，包括认为绩效与个人实际工作情况不符，在其生病后，网易采用各种方式希望其离职，避免进行N+1的离职赔偿，其间遇到了“逼迫、算计、监视、陷害、威胁，甚至被保安赶出公司”。

　　以下为文章全文：

　　网易裁员，让保安把身患绝症的我赶出公司。我在网易亲身经历的噩梦！
...
阅读全文>>

Top | 类别: 新闻资讯 | 评论 (0) | 标签: 控诉, 网易暴力, 裁员, Netease, 163, | 中文 | 1286 次阅读, 16759 次搜索 | 10490 个汉字

133 - 《奇葩说》薛兆丰道破996真相：我们都在为自己的简历打工 - you-are-working-for-your-resume.txt

@人力资源研究:《奇葩说》薛兆丰道破996真相：我们都在为自己的简历打工

上周四《奇葩说》开始了首场导师带队赛，辩题是：感兴趣的工作总是996，我该不该886（说再见）？

这个话题还比较接地气，双方的论述老实说都有点无聊，最后热门新选手许吉如被淘汰了，听许吉如的论述，恐怕她自己都说服不了自己，她的论点毫无力量感。
...
阅读全文>>

Top | 类别: 成功 | 评论 (0) | 标签: 奇葩说, 薛兆丰, 996, 简历打工, Resume, | 中文 | 335 次阅读, 17222 次搜索 | 1505 个汉字

134 - 每日算法题: Queue Using Two Stacks - queue-using-two-stacks.txt

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

Implement a queue class using two stacks. A queue is a data structure that supports the FIFO protocol (First in = first out). Your class should support the enqueue and dequeue methods like a standard queue.

Here's a starting point:
...
阅读全文>>

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

135 - 每日算法题: Maximum Profit From Stocks - maximum-profit-from-stocks.txt

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

You are given an array. Each element represents the price of a stock on that particular day. Calculate and return the maximum profit you can make from buying and selling that stock only once.

For example: [9, 11, 8, 5, 7, 10]
...
阅读全文>>

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