To the Top

Big Big World

Subscribe blog items in this category or Feedburner

Category: All | Others(52) | Computing(163) | Life(35) | Success(18) | Funny Stuffs(24) | Memory(4) | To Share(60) | Love and Romantics(14) | News(84) | Fortune Quotes(92) | Q & A(26) | Health(6) | Pictures(5) | Stories(6) | Videos(13) | Cryptocurrency-Blockchain(1) |
Total: 163 - Statistics | Archive
« Previous ( Page : 1 2 3 4 5 6 7 8 9 .. ) Next »

49 - Daily Interview Problem: Min Range Needed to Sort - min-range-needed-to-sort.txt

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

Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.

Example:
...
Full Text>>

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

50 - Daily Interview Problem: Distribute Bonuses - distribute-bonuses.txt

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

You are the manager of a number of employees who all sit in a row. The CEO would like to give bonuses to all of your employees, but since the company did not perform so well this year the CEO would like to keep the bonuses to a minimum.

The rules of giving bonuses is that:
...
Full Text>>

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

51 - Daily Interview Problem: Tree Serialization - tree-serialization.txt

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

You are given the root of a binary tree. You need to implement 2 functions:

1. serialize(root) which serializes the tree into a string representation
...
Full Text>>

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

52 - Daily Interview Problem: Arithmetic Binary Tree - arithmetic-binary-tree.txt

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

You are given a binary tree representation of an arithmetic expression. In this tree, each leaf is an integer value,, and a non-leaf node is one of the four operations: '+', '-', '*', or '/'.

Write a function that takes this tree and evaluates the expression.
...
Full Text>>

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

53 - [Daily Problem] Angles of a Clock - -angles-of-a-clock.txt.txt

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

Given a time in the format of hour and minute, calculate the angle of the hour and minute hand on a clock.


...
Full Text>>

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

54 - [Daily Problem] Longest Increasing Subsequence - longest-increasing-subsequence.txt.txt

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

You are given an array of integers. Return the length of the longest increasing subsequence (not necessarily contiguous) in the array.

Example:
...
Full Text>>

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

55 - 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 | 144 Views, 17961 Search Bots | 80 Words

56 - 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 | 176 Views, 16616 Search Bots | 79 Words

57 - 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 | 188 Views, 19969 Search Bots | 98 Words

58 - 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 | 196 Views, 17703 Search Bots | 102 Words

59 - 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 | 359 Views, 15942 Search Bots | 43 Words

60 - 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 | 371 Views, 15825 Search Bots | 49 Words

61 - 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 | 169 Views, 16073 Search Bots | 77 Words

62 - 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 | 165 Views, 15624 Search Bots | 74 Words

63 - 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 | 143 Views, 15590 Search Bots | 125 Words

64 - 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 | 186 Views, 18036 Search Bots | 118 Words


Category: All | Others(52) | Computing(163) | Life(35) | Success(18) | Funny Stuffs(24) | Memory(4) | To Share(60) | Love and Romantics(14) | News(84) | Fortune Quotes(92) | Q & A(26) | Health(6) | Pictures(5) | Stories(6) | Videos(13) | Cryptocurrency-Blockchain(1) |
Total: 163 - Statistics | Archive
« Previous ( Page : 1 2 3 4 5 6 7 8 9 .. ) Next »

Page Edited: May 11 2024 14:46:11 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />