97 - Daily Interview Problem: Given two arrays, write a function to compute their intersection. - given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt

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

Given two arrays, write a function to compute their intersection - the intersection means the numbers that are in both arrays.

Example 1:
...
Full Text>>

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

98 - Daily Interview Problem: Product of Array Except Self - product-of-array-except-self.txt.txt

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

You are given an array of integers. Return an array of the same size where the element at each index is the product of all the elements in the original array except for the element at that index.

For example, an input of [1, 2, 3, 4, 5] should return [120, 60, 40, 30, 24].
...
Full Text>>

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

99 - Daily Interview Problem: Merge List Of Number Into Ranges - merge-list-of-number-into-ranges.txt.txt

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

Given a sorted list of numbers, return a list of strings that represent all of the consecutive numbers.

Example:
...
Full Text>>

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

100 - Daily Interview Problem: Reverse Words in a String - reverse-words-in-a-string.txt.txt

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

Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Example 1:
...
Full Text>>

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

101 - Daily Interview Problem: Room scheduling - room-scheduling.txt.txt

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

You are given an array of tuples (start, end) representing time intervals for lectures. The intervals may be overlapping. Return the number of rooms that are required.

For example. [(30, 75), (0, 50), (60, 150)] should return 2.
Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | 358 Views, 15940 Search Bots | 43 Words

102 - Daily Interview Problem: Running Median - running-median.txt.txt

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

You are given a stream of numbers. Compute the median for each new element .

Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5, 2, 3.0, 2, 2, 2]
...
Full Text>>

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

103 - Daily Interview Problem: Group Words that are Anagrams - group-words-that-are-anagrams.txt.txt

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

Given a list of words, group the words that are anagrams of each other. (An anagram are words made up of the same letters).

Example:
...
Full Text>>

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

104 - Daily Interview Problem: Minimum Removals for Valid Parenthesis - minimum-removals-for-valid-parenthesis.txt.txt

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

You are given a string of parenthesis. Return the minimum number of parenthesis that would need to be removed in order to make the string valid. "Valid" means that each open parenthesis has a matching closed parenthesis.

Example:
...
Full Text>>

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

105 - Daily Interview Problem: Find the Number of Islands - find-the-number-of-islands.txt.txt

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

Given a 2-dimensional grid consisting of 1's (land blocks) and 0's (water blocks), count the number of islands present in the grid. The definition of an island is as follows:
1.) Must be surrounded by water blocks.
2.) Consists of land blocks (1's) connected to adjacent land blocks (either vertically or horizontally).
...
Full Text>>

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

106 - Daily Interview Problem: Largest BST in a Binary Tree - largest-bst-in-a-binary-tree.txt.txt

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

You are given the root of a binary tree. Find and return the largest subtree of that tree, which is a valid binary search tree.

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

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

107 - 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 | 1040 Views, 14337 Search Bots | 92 Words

108 - 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 | 190 Views, 17558 Search Bots | 107 Words

109 - 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, 14656 Search Bots | 118 Words

110 - 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 | 127 Views, 16289 Search Bots | 164 Words

111 - 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 | 166 Views, 14977 Search Bots | 135 Words

112 - 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 | 233 Views, 18537 Search Bots | 94 Words