To the Top

Big Big World

Subscribe blog items in this category or Feedburner

Category: All | Others(55) | Computing(175) | Life(35) | Success(21) | Funny Stuffs(25) | Memory(4) | To Share(63) | Love and Romantics(17) | News(96) | Fortune Quotes(92) | Q & A(26) | Health(7) | Pictures(5) | Stories(6) | Videos(13) | Cryptocurrency-Blockchain(6) | AI(3) |
Total: 649 - Statistics | Archive
« Previous ( Page :  .. 6 7 8 9 10 11 12 13 14 15 16 .. ) Next »

111 - Algorithm Interview: Subarray With Target Sum - subarray-with-target-sum.txt

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

You are given an array of integers, and an integer K. Return the subarray which sums to K. You can assume that a solution will always exist.


...
Full Text>>

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

112 - Algorithm Interview: Longest Consecutive Sequence - longest-consecutive-sequence.txt

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

You are given an array of integers. Return the length of the longest consecutive elements sequence in the array.

For example, the input array [100, 4, 200, 1, 3, 2] has the longest consecutive sequence 1, 2, 3, 4, and thus, you should return its length, 4.
...
Full Text>>

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

113 - Algorithm Interview: Permutations of numbers - permutations-of-numbers.txt

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

You are given an array of integers. Return all the permutations of this array.


...
Full Text>>

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

114 - Algorithm Interview: Maximum Path Sum in Binary Tree - maximum-path-sum-in-binary-tree.txt

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

You are given the root of a binary tree. Find the path between 2 nodes that maximizes the sum of all the nodes in the path, and return the sum. The path does not necessarily need to go through the root.


...
Full Text>>

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

115 - Algorithm Interview: Smallest Number that is not a Sum of a Subset of List - smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt

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

Given a sorted list of positive numbers, find the smallest positive number that cannot be a sum of any subset in the list.

Example:
...
Full Text>>

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

116 - Algorithm Interview: Make the Largest Number - make-the-largest-number.txt

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

Given a number of integers, combine them so it would create the largest number.

Example:
...
Full Text>>

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

117 - Algorithm Interview: No Adjacent Repeating Characters - no-adjacent-repeating-characters.txt

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

Given a string, rearrange the string so that no character next to each other are the same. If no such arrangement is possible, then return None.

Example:
...
Full Text>>

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

118 - Algorithm Interview: String Compression - string-compression.txt

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

Given an array of characters with repeats, compress it in place. The length after compression should be less than or equal to the original array.

Example:
...
Full Text>>

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

119 - Algorithm Interview: Convert Roman Numerals to Decimal - convert-roman-numerals-to-decimal.txt

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

Given a Roman numeral, find the corresponding decimal value. Inputs will be between 1 and 3999.

Example:
...
Full Text>>

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

120 - Algorithm Interview Question: Find the Single Element in an Array of Duplicates - find-the-single-element-in-an-array-of-duplicates.txt

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

Given an array of integers, arr, where all numbers occur twice except one number which occurs once, find the number. Your solution should ideally be O(n) time and use constant extra space.
Example:
Input: arr = [7, 3, 5, 5, 4, 3, 4, 8, 8]
...
Full Text>>

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

121 - Algorithm Interview Question: Nth Fibonacci Number - nth-fibonacci-number.txt

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

The Fibonacci sequence is the integer sequence defined by the recurrence relation: F(n) = F(n-1) + F(n-2), where F(0) = 0 and F(1) = 1. In other words, the nth Fibonacci number is the sum of the prior two Fibonacci numbers. Below are the first few values of the sequence:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...
...
Full Text>>

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


Category: All | Others(55) | Computing(175) | Life(35) | Success(21) | Funny Stuffs(25) | Memory(4) | To Share(63) | Love and Romantics(17) | News(96) | Fortune Quotes(92) | Q & A(26) | Health(7) | Pictures(5) | Stories(6) | Videos(13) | Cryptocurrency-Blockchain(6) | AI(3) |
Total: 649 - Statistics | Archive
« Previous ( Page :  .. 6 7 8 9 10 11 12 13 14 15 16 .. ) Next »

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