65 - Daily Interview Problem: 3 Sum - 3-sum.txt.txt

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

Given an array, nums, of n integers, find all unique triplets (three numbers, a, b, & c) in nums such that a + b + c = 0. Note that there may not be any triplets that sum to zero in nums, and that the triplets must not be duplicates.

Example:
...
Full Text>>

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

66 - Daily Interview Problem: Word Ordering in a Different Alphabetical Order - word-ordering-in-a-different-alphabetical-order.txt.txt

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

Given a list of words, and an arbitrary alphabetical order, verify that the words are in order of the alphabetical order.

Example:
...
Full Text>>

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

67 - Daily Interview Problem: Sort Colors - sort-colors.txt.txt

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

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.

Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
...
Full Text>>

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

68 - Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals - reconstrunct-binary-tree-from-preorder-and-inorder-traversals.txt.txt

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

You are given the preorder and inorder traversals of a binary tree in the form of arrays. Write a function that reconstructs the tree represented by these traversals.

Example:
...
Full Text>>

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

69 - 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 | 167 Views, 14978 Search Bots | 135 Words

70 - 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 | 234 Views, 18537 Search Bots | 94 Words

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

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

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

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

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

72 - 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 | 200 Views, 19822 Search Bots | 81 Words

73 - 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 | 150 Views, 13615 Search Bots | 128 Words

74 - 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 | 156 Views, 16381 Search Bots | 89 Words

75 - 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 | 313 Views, 14120 Search Bots | 77 Words

76 - 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 | 181 Views, 16785 Search Bots | 106 Words

77 - 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 | 693 Views, 14864 Search Bots | 109 Words

78 - 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 | 389 Views, 14303 Search Bots | 85 Words

79 - 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 | 175 Views, 15932 Search Bots | 111 Words

80 - 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 | 192 Views, 17089 Search Bots | 98 Words