151 - Daily Interview Puzzle: Intersection of Linked Lists - intersection-of-linked-lists.txt

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

You are given two singly linked lists. The lists intersect at some node. Find, and return the node. Note: the lists are non-cyclical.

Example:
...
Full Text>>

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

152 - Daily Interview Puzzle: Ways to Traverse a Grid - ways-to-traverse-a-grid.txt

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

You 2 integers n and m representing an n by m grid, determine the number of ways you can get from the top-left to the bottom-right of the matrix y going only right or down.

Example:
...
Full Text>>

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

153 - Daily Interview Puzzle: Minimum Size Subarray Sum - minimum-size-subarray-sum.txt

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

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.

Example:
...
Full Text>>

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

154 - Daily Interview Question: Word Search - word-search.txt

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

You are given a 2D array of characters, and a target string. Return whether or not the word target word exists in the matrix. Unlike a standard word search, the word must be either going left-to-right, or top-to-bottom in the matrix.

Example:
...
Full Text>>

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

155 - Daily Interview Question: Find Cycles in a Graph - find-cycles-in-a-graph.txt

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

Given an undirected graph, determine if a cycle exists in the graph.

Here is a function signature:
...
Full Text>>

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

156 - Daily Interview Question: Longest Sequence with Two Unique Numbers - longest-sequence-with-two-unique-numbers.txt

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

Given a sequence of numbers, find the longest sequence that contains only 2 unique numbers.

Example:
...
Full Text>>

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

157 - Daily Interview Question: 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:
...
Full Text>>

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

158 - How to Register OCX/DLL under Windows 64bit - 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操作系统，具体方法是：
...
Full Text>>

Top | Category: Computing | Comments (0) | Tags: 注册OCX, 32位OCX/DLL控件, Windows 10, 32 bit OCX, DLL, Windows 10, Register OCX, | 中文 | 268 Views, 33003 Search Bots | 189 Characters

159 - 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 | 737 Views, 17032 Search Bots | 80 Words

160 - 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 | 315 Views, 17298 Search Bots | 57 Words

161 - 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 | 297 Views, 19083 Search Bots | 74 Words

162 - 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 | 425 Views, 16519 Search Bots | 105 Words

163 - 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 | 381 Views, 17011 Search Bots | 164 Words

164 - 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 | 368 Views, 23224 Search Bots | 119 Words

165 - 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 | 284 Views, 25216 Search Bots | 126 Words