209 - Invert a Binary Tree - invert-a-binary-tree.txt

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

You are given the root of a binary tree. Invert the binary tree in place. That is, all left children should become right children, and all right children should become left children.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 75598 Views, 33656 Search Bots | 164 Words

210 - Floor and Ceiling of a Binary Search Tree - floor-and-ceiling-of-a-binary-search-tree.txt

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

Given an integer k and a binary search tree, find the floor (less than or equal to) of k, and the ceiling (larger than or equal to) of k. If either does not exist, then print them as None.

Here is the definition of a node for the tree.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 64198 Views, 54472 Search Bots | 119 Words

211 - Non-decreasing Array with Single Modification - non-decreasing-array-with-single-modification.txt

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

You are given an array of integers in an arbitrary order. Return whether or not it is possible to make the array non-decreasing by modifying at most 1 element to any value.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n).
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 78395 Views, 44985 Search Bots | 126 Words

212 - Find the non-duplicate number - find-the-non-duplicate-number.txt

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

Given a list of numbers, where every number shows up twice except for one number, find that one number.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 74389 Views, 29632 Search Bots | 60 Words

213 - Two-Sum - two-sum.txt

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

You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 77962 Views, 25356 Search Bots | 76 Words

214 - Sorting a list with 3 unique numbers - sorting-a-list-with-3-unique-numbers.txt

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

Given a list of numbers with only 3 unique numbers (1, 2, 3), sort the list in O(n) time.

Example 1:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 75152 Views, 40081 Search Bots | 51 Words

215 - Reverse a Linked List - reverse-a-linked-list.txt

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

Given a singly-linked list, reverse the list. This can be done iteratively or recursively. Can you get both solutions?

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 76150 Views, 29115 Search Bots | 149 Words

216 - First and Last Indices of an Element in a Sorted Array - daily-problem-first-and-last-indices-of-an-element-in-a-sorted-array.txt

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

Given a sorted array, A, with possibly duplicated elements, find the indices of the first and last occurrences of a target element, x. Return -1 if the target is not found.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 74996 Views, 92346 Search Bots | 87 Words

217 - [Daily Problem] Validate Balanced Parentheses - daily-problem-validate-balanced-parentheses.txt

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

Imagine you are building a compiler. Before running any code, the compiler must check that the parentheses in the program are balanced. Every opening bracket must have a corresponding closing bracket. We can approximate this using strings.

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法, 括号匹配, 面试, Python, daily problem, Validate Balanced Parentheses, algorithms, twitter interview question, python, | English | 77384 Views, 40256 Search Bots | 161 Words

218 - [Daily Problem] Longest Palindromic Substring - daily-problem-twitter-palindrome.txt

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

A palindrome is a sequence of characters that reads the same backwards and forwards. Given a string, s, find the longest palindromic substring in s.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | English | 73922 Views, 26340 Search Bots | 69 Words

219 - Longest Substring Without Repeating Characters - daily-problem-longest-substring-without-repating-characters.txt

This problem was recently asked by Microsoft:

Given a string, find the length of the longest substring without repeating characters.

Here is an example solution in Python language. (Any language is OK to use in an interview, though we'd recommend Python as a generalist language utilized by companies like Google, Facebook, Netflix, Dropbox, Pinterest, Uber, etc.,)
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | English | 71760 Views, 41000 Search Bots | 81 Words

220 - [Daily Problem] Add two numbers as a linked list - daily-problem-add-two-numbers-as-a-linked-list.txt

This problem was recently asked by Microsoft: You are given two linked-lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每天算法, 算法, 数据结构, 链表, daily problem, linked list, programming, algorithm, | English | 75265 Views, 54091 Search Bots | 214 Words

221 - Girls do not always like flowers - girls-do-not-like-flowers.txt

又送花？六一送花，情人节还送花？！你不会买两瓶九（酒）啊，我不喝醉，你有机会，你有机会吗？！

女孩子要包的，包治百病，包能让女人达到GC的（G点）。
Top | Category: Videos | Comments (0) | Tags: 情人节还送花, 送女人礼物, valentine, | 中文 | 54979 Views, 26158 Search Bots | 54 Characters

222 - 亚马逊雨林是“地球之肺”，但是如果它烧没了，我们并不会因为缺氧而憋死 - amazon-fire.txt


今天看到Peter Brannen写了一个很好的问题。虽然我们喜欢说亚马逊雨林是“地球之肺”，亚马逊的火灾也确实是生态和人道的双重灾难，但是如果它烧没了，我们并不会因为缺氧而憋死。

有一个经常引用的数据是亚马逊产出了地球氧气的20%，但它是双重的不准确。一，亚马逊每天产出的氧气实际上是地球上所有活体生物光合作用产氧总量的6%；二，地球上绝大部分氧气，并不是现在活着的生命造出来的。

...
Full Text>>

Top | Category: News | Comments (0) | Tags: 亚马逊, 大火, Amazon Rainforest fire, | 中文 | 84733 Views, 25022 Search Bots | 1390 Characters

223 - 国家目前拥有和积累财富最多的是哪一代人？ - which-generation-is-richest.txt

你觉得我们国家目前拥有和积累财富最多的是哪一代人？答案是60年代人口高峰出生的一代人。63年开始我国每年出生人口都超过2500万，这批人正好碰到改开，整体学历都不高，满打满算都不可能有5%的人正规读过大学。这批人当中生活优良的中产阶级到底是怎么来的？是因为他们敢打敢拼敢创造？

不是的。就像昨天我写微博问答的时候有人问到环球的主编胡锡进先生，他就自己讲过自己的经历。04年的时候贷款总价不到百万在北京买了套140平的房子，现在光这套房子就能给他带来千万的身家。那个年代普遍过的好的人就是找份稳定工作，该结婚的时候结婚，该买房的时候买房，该生孩子的时候生孩子。要是碰巧“有投资眼光”多买了一套房子，根本就不会想着要儿女养老，而是老了还能补贴自己新时代高学历的子女。

你要是90年后出生的人，看着这样的老一代心里能平衡吗？人家学历不如你，工作态度也比不上你勤奋，没有996的加班，也没有所谓的见识。思想顽固，跟不上潮流。但是人家就是比你有钱啊。你现在哪怕人大新闻系毕业走进报社靠工资一辈子不吃不喝都不可能买得起北京一套140平的房子的。
...
Full Text>>

Top | Category: Others | Comments (0) | Tags: 积累财富, 哪一代人, richest generation, | 中文 | 88208 Views, 29774 Search Bots | 960 Characters

224 - 小事 | 选择比努力更重要 - importance-of-a-decision.txt

我北邮电子工程本，电子系计算机应用专业硕，05 年毕业。这个起点如何？

我每天都在加班，晚上周末在持续学习跟踪新技术，努力程度怎么说呢我没见过比我更努力的，这个努力程度如何？

然而我今年 39 岁，失业两个多月，投出去简历至今一个约面试的都没有。
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 选择, 努力, 重要, Decision Making, | 中文 | 89086 Views, 34224 Search Bots | 979 Characters