205 - Daily Interview Question: Edit Distance - edit-distance.txt

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

Given two strings, determine the edit distance between them. The edit distance is defined as the minimum number of edits (insertion, deletion, or substitution) needed to change one string to the other.

For example, "biting" and "sitting" have an edit distance of 2 (substitute b for s, and insert a t).
...
Full Text>>

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

206 - Find Pythagorean Triplets - find-pythagorean-triplets.txt

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

Given a list of numbers, find if there exists a pythagorean triplet in that list. A pythagorean triplet is 3 variables a, b, c where a^2 + b^2 = c^2

Example:
...
Full Text>>

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

207 - Number of Ways to Climb Stairs - number-of-ways-to-climb-stairs.txt

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

You are given a positive integer N which represents the number of steps in a staircase. You can either climb 1 or 2 steps at a time. Write a function that returns the number of unique ways to climb the stairs.

...
Full Text>>

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

208 - Maximum In A Stack - maximum-in-a-stack.txt

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

Implement a class for a stack that supports all the regular functions (push, pop) and an additional function of max() which returns the maximum element in the stack (return None if the stack is empty). Each method should run in constant time.

...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms,  | English | 74842 Views, 27135 Search Bots | 105 Words

209 - Invert a Binary Tree - invert-a-binary-tree.txt

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

You are given the root of a binary tree. Invert the binary tree in place. That is, all left children should become right children, and all right children should become left children.

Example:
...
Full Text>>

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

210 - Floor and Ceiling of a Binary Search Tree - floor-and-ceiling-of-a-binary-search-tree.txt

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

Given an integer k and a binary search tree, find the floor (less than or equal to) of k, and the ceiling (larger than or equal to) of k. If either does not exist, then print them as None.

Here is the definition of a node for the tree.
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 64335 Views, 54474 Search Bots | 119 Words

211 - Non-decreasing Array with Single Modification - non-decreasing-array-with-single-modification.txt

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

You are given an array of integers in an arbitrary order. Return whether or not it is possible to make the array non-decreasing by modifying at most 1 element to any value.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n).
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 78541 Views, 44988 Search Bots | 126 Words

212 - Find the non-duplicate number - find-the-non-duplicate-number.txt

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

Given a list of numbers, where every number shows up twice except for one number, find that one number.

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 74548 Views, 29632 Search Bots | 60 Words

213 - Two-Sum - two-sum.txt

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

You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.

Example:
...
Full Text>>

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

214 - Sorting a list with 3 unique numbers - sorting-a-list-with-3-unique-numbers.txt

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

Given a list of numbers with only 3 unique numbers (1, 2, 3), sort the list in O(n) time.

Example 1:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 75298 Views, 40087 Search Bots | 51 Words

215 - Reverse a Linked List - reverse-a-linked-list.txt

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

Given a singly-linked list, reverse the list. This can be done iteratively or recursively. Can you get both solutions?

Example:
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | 76298 Views, 29119 Search Bots | 149 Words

216 - First and Last Indices of an Element in a Sorted Array - daily-problem-first-and-last-indices-of-an-element-in-a-sorted-array.txt

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

Given a sorted array, A, with possibly duplicated elements, find the indices of the first and last occurrences of a target element, x. Return -1 if the target is not found.

Example:
...
Full Text>>

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