81 - Daily Interview Problem: Count Number of Unival Subtrees - count-number-of-unival-subtrees.txt.txt

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

A unival tree is a tree where all the nodes have the same value. Given a binary tree, return the number of unival subtrees in the tree.

For example, the following tree should return 5:
...
Full Text>>

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

82 - Daily Interview Problem: Longest Substring With K Distinct Characters - longest-substring-with-k-distinct-characters.txt.txt

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

You are given a string s, and an integer k. Return the length of the longest substring in s that contains at most k distinct characters.

For instance, given the string:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, Longest Substring With K Distinct Characters算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 76018 Views, 42024 Search Bots | 94 Words

83 - 微信拉黑和删除有啥区别？ - wechat-block.txt.txt

相信很多使用微信的读者都曾经拉黑过某人，更不用说删除好友了，虽然拉黑和删除都能起到拒绝接收对方信息的效果，但它们具体有什么异同呢？拉黑和删除之后，还可以收发消息吗？聊天记录还在吗？还可以重新添加吗？对方知道自己被我拉黑/删除吗？

为了解答这个困扰良久的未解之谜，12月4日，腾讯微信团队官微在微博科普了拉黑与删除的区别。

问：还可以收发信息吗?
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 微信, 拉黑, 删除, 区别, Wechat, Block, | 中文 | 88859 Views, 26407 Search Bots | 356 Characters

84 - Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree - get-all-values-at-a-certain-height-in-a-binary-tree.txt.txt

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

Given a binary tree, return all values given a certain height h.

Here's a starting point:
...
Full Text>>

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

85 - Daily Interview Problem: Validate Binary Search Tree - validate-binary-search-tree.txt.txt

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

You are given the root of a binary search tree. Return true if it is a valid binary search tree, and false otherwise. Recall that a binary search tree has the property that all values in the left subtree are less than or equal to the root, and all values in the right subtree are greater than or equal to the root.

Here's a starting point:
...
Full Text>>

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

86 - Daily Interview Problem: First Missing Positive Integer - first-missing-positive-integer.txt

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

You are given an array of integers. Return the smallest positive integer that is not present in the array. The array may contain duplicate entries.

For example, the input [3, 4, -1, 1] should return 2 because it is the smallest positive integer that doesn't exist in the array.
...
Full Text>>

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

96 - Daily Interview Problem: Merge Overlapping Intervals - merge-overlapping-intervals.txt

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

You are given an array of intervals - that is, an array of tuples (start, end). The array may not be sorted, and could contain overlapping intervals. Return another array where the overlapping intervals are merged.

For example:
...
Full Text>>

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