113 - 每日算法题 - Create a Simple Calculator - create-a-simple-calculator.txt

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

Given a mathematical expression with just single digits, plus signs, negative signs, and brackets, evaluate the expression. Assume the expression is properly formed.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 77102 次阅读, 37600 次搜索 | 61 个单词

114 - Windows 10下注册32位OCX控件的方法 - how-to-register-32-bit-ocx-component-under-windows-10.txt

Windows 10下注册32位OCX控件的方法

　对于早期的32位Windows操作系统，我们可以直接注册OCX或DLL控件，但是在64位系统下是不可行的，而对于支持UAC（例如Windows 10等）的系统，就必须要复制到指定的目录，并使用管理员权限才能成功注册。

　　对于64位Windows 10操作系统，具体方法是：
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 注册OCX, 32位OCX/DLL控件, Windows 10, 32 bit OCX, DLL, Windows 10, Register OCX, | 中文 | 67308 次阅读, 78852 次搜索 | 189 个汉字

115 - 每日算法题 - Edit Distance I - 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).
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 62879 次阅读, 26854 次搜索 | 80 个单词

116 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 74804 次阅读, 26663 次搜索 | 57 个单词

117 - 每日算法题 - 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.

...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms,  | 英文 | 73963 次阅读, 34837 次搜索 | 74 个单词

118 - 每日算法题 - 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.

...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms,  | 英文 | 74679 次阅读, 27135 次搜索 | 105 个单词

119 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 75598 次阅读, 33656 次搜索 | 164 个单词

120 - 每日算法题 - 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.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 64198 次阅读, 54472 次搜索 | 119 个单词

121 - 每日算法题 - 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).
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 78395 次阅读, 44985 次搜索 | 126 个单词

122 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 74389 次阅读, 29632 次搜索 | 60 个单词

123 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 77962 次阅读, 25356 次搜索 | 76 个单词

124 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 75152 次阅读, 40081 次搜索 | 51 个单词

125 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 76151 次阅读, 29115 次搜索 | 149 个单词

126 - 每日算法题 - 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:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 74997 次阅读, 92346 次搜索 | 87 个单词

127 - [Daily Problem] Validate Balanced Parentheses - daily-problem-validate-balanced-parentheses.txt

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

Imagine you are building a compiler. Before running any code, the compiler must check that the parentheses in the program are balanced. Every opening bracket must have a corresponding closing bracket. We can approximate this using strings.

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法, 括号匹配, 面试, Python, daily problem, Validate Balanced Parentheses, algorithms, twitter interview question, python, | 英文 | 77385 次阅读, 40256 次搜索 | 161 个单词

128 - [Daily Problem] Longest Palindromic Substring - daily-problem-twitter-palindrome.txt

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

A palindrome is a sequence of characters that reads the same backwards and forwards. Given a string, s, find the longest palindromic substring in s.

Example:
...
阅读全文>>

Top | 类别: 计算机科学 | 评论 (0) | 标签: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | 英文 | 73923 次阅读, 26341 次搜索 | 69 个单词