原文链接: https://leetcode-cn.com/problems/living-people-lcci 英文原文Given a list of people with their birth and death years, implement a method to compute the year with the most number of people alive. You may assume that all people were born between 1900 …

原文链接: https://leetcode-cn.com/problems/diving-board-lcci 英文原文You are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length shorter and one of length longer. You must use exactly K planks…

原文链接: https://leetcode-cn.com/problems/bisect-squares-lcci 英文原文Given two squares on a two-dimensional plane, find a line that would cut these two squares in half. Assume that the top and the bottom sides of the square run parallel to the x-axis. Each…

原文链接: https://leetcode-cn.com/problems/best-line-lcci 英文原文Given a two-dimensional graph with points on it, find a line which passes the most number of points. Assume all the points that passed by the line are stored in list S sorted by their number. …

原文链接: https://leetcode-cn.com/problems/master-mind-lcci 英文原文The Game of Master Mind is played as follows: The computer has four slots, and each slot will contain a ball that is red (R). yellow (Y). green (G) or blue (B). For example, the computer mig…

原文链接: https://leetcode-cn.com/problems/sub-sort-lcci 英文原文Given an array of integers, write a method to find indices m and n such that if you sorted elements m through n, the entire array would be sorted. Minimize n - m (that is, find the smallest suc…

原文链接: https://leetcode-cn.com/problems/contiguous-sequence-lcci 英文原文You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum. Example: Input: [-2,1,-3,4,-1,2,1,-5,4] Output: 6 …

原文链接: https://leetcode-cn.com/problems/pond-sizes-lcci 英文原文You have an integer matrix representing a plot of land, where the value at that loca­tion represents the height above sea level. A value of zero indicates water. A pond is a region of wat…

原文链接: https://leetcode-cn.com/problems/one-away-lcci 英文原文There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edi…

原文链接: https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci 英文原文Implement an algorithm to find the kth to last element of a singly linked list. Return the value of the element. Note: This problem is slightly different from the original one …

原文链接: https://leetcode-cn.com/problems/partition-list-lcci 英文原文Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of …

原文链接: https://leetcode-cn.com/problems/bst-sequences-lcci 英文原文A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possible arrays …

原文链接: https://leetcode-cn.com/problems/paths-with-sum-lcci 英文原文You are given a binary tree in which each node contains an integer value (which might be positive or negative). Design an algorithm to count the number of paths that sum to a given value.…

原文链接: https://leetcode-cn.com/problems/robot-in-a-grid-lcci 英文原文Imagine a robot sitting on the upper left corner of grid with r rows and c columns. The robot can only move in two directions, right and down, but certain cells are "off limits" such tha…

原文链接: https://leetcode-cn.com/problems/sorted-merge-lcci 英文原文You are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order. Initially the number of elements in A and…

原文链接: https://leetcode-cn.com/problems/peaks-and-valleys-lcci 英文原文In an array of integers, a "peak" is an element which is greater than or equal to the adjacent integers and a "valley" is an element which is less than or equal to the adjacent inte&sh…

原文链接: https://leetcode-cn.com/problems/hanota-lcci 英文原文In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from…

原文链接: https://leetcode-cn.com/problems/pattern-matching-lcci 英文原文You are given two strings, pattern and value. The pattern string consists of just the letters a and b, describing a pattern within a string. For example, the string catcatgocatgo matche…

原文链接: https://leetcode-cn.com/problems/sorted-matrix-search-lcci 英文原文Given an M x N matrix in which each row and each column is sorted in ascending order, write a method to find an element. Example: Given matrix: [ [1, 4, 7, 11, 15], [2, 5, 8, 12, 19…

原文链接: https://leetcode-cn.com/problems/factorial-zeros-lcci 英文原文Write an algorithm which computes the number of trailing zeros in n factorial. Example 1: Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero. Example 2: Input: 5 Output: 1 Explanat…

原文链接: https://leetcode-cn.com/problems/binode-lcci 英文原文The data structure TreeNode is used for binary tree, but it can also used to represent a single linked list (where left is null, and right is the next node in the list). Implement a method to con…

原文链接: https://leetcode-cn.com/problems/re-space-lcci 英文原文Oh, no! You have accidentally removed all spaces, punctuation, and capitalization in a lengthy document. A sentence like "I reset the computer. It still didn't boot!" became "iresetthecomputeri…

原文链接: https://leetcode-cn.com/problems/longest-word-lcci 英文原文Given a list of words, write a program to find the longest word made of other words in the list. If there are more than one answer, return the one that has smallest lexicographic order. If …

原文链接: https://leetcode-cn.com/problems/smallest-k-lcci 英文原文Design an algorithm to find the smallest K numbers in an array. Example: Input: arr = [1,3,5,7,2,4,6,8], k = 4 Output: [1,2,3,4] Note: 0 <= len(arr) <= 100000 0 <= k <= min(100000, len(arr)) …

原文链接: https://leetcode-cn.com/problems/the-masseuse-lcci 英文原文A popular masseuse receives a sequence of back-to-back appointment requests and is debating which ones to accept. She needs a break between appointments and therefore she cannot accept any …

原文链接: https://leetcode-cn.com/problems/multi-search-lcci 英文原文Given a string band an array of smaller strings T, design a method to search b for each small string in T. Output positions of all strings in smalls that appear in big, where positions[i] i…

原文链接: https://leetcode-cn.com/problems/add-without-plus-lcci 英文原文Write a function that adds two numbers. You should not use + or any arithmetic operators. Example: Input: a = 1, b = 1 Output: 2 Note: a and b may be 0 or negative. The result fits in 3…

原文链接: https://leetcode-cn.com/problems/lru-cache-lcci 英文原文Design and build a "least recently used" cache, which evicts the least recently used item. The cache should map from keys to values (allowing you to insert and retrieve a value associ&shy;ated…

原文链接: https://leetcode-cn.com/problems/calculator-lcci 英文原文Given an arithmetic equation consisting of positive integers, +, -, * and / (no paren&shy;theses), compute the result. The expression string contains only non-negative integers, +, -, *, / op…

原文链接: https://leetcode-cn.com/problems/continuous-median-lcci 英文原文Numbers are randomly generated and passed to a method. Write a program to find and maintain the median value as new values are generated. Median is the middle value in an ordered integ…