Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.

You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in forward order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.

Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.

Given an integer array with no duplicates. A max tree building on this array is defined as follow:

Kraken is m*n grids on a rectangular board. From the top left to reach the bottom right corner while moving one grid at a time in either the down, right or down-right diagonal directions

System Design Concept — Logic — Implementation {代码...} Design Netflix SNAKE Analysis 1. Scenario: 枚举&排序 {代码...} 2. Needs/Necessary: 限制 {代码...} 3. Application/Kilobyte 重访&组合/添加&选择 {代码...} 4. Evolve 分析&回溯 {代码...} Design Recommendation Module: {代码...} De...

A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.

算法 链表 【LC总结】翻转链表 Swap in Pairs, Reverse in k-Group, Reverse LinkedList###Reverse a doubly linkedlist reverse singly linked list Iteration: {代码...} Recursion: {代码...} 二叉树 Subtree {代码...} Binary Tree Level Order Traversal If is required bottom-up, use Collections.reverse(res); ...

For example,Given 1->2->3->4, you should return the list as 2->1->4->3.

Head loop through the list: Store head.next, head points to tail, tail becomes head, head goes to stored head.next;

Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it.

get: Provide a number which is not assigned to anyone.check: Check if a number is available or not.release: Recycle or release a number.

输入第一行是要判断的字符串的个数n，之后的n行输入为需要判断的字符串。每个字符串str，是两个等长字符串的合体，所以长度一定是偶数。若为奇数，返回-1。所以str分成两个substring，右边需要多少次操作能变为左边。只要用一个26位的数组统计每个字符在a和b中出现的次数就行，在a中出现+1，在b中出现-1，最后统计数组的...

Given a non-empty array of integers, return the k most frequent elements.

There are a total of n courses you have to take, labeled from 0 to n - 1.

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Problem Count the number of prime numbers less than a non-negative number, n. Note 用数组flag标记非质数，每当出现一个flag[i]为false，计数器count加一。关于质数有三点： 大于3的质数一定是奇数，如3，5，7； 奇数中的非质数也一定是奇数的乘积。 对于一个很大的数n，它的两个因数i和j中一定有一个小于n的开方，...

Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.

Given an array of integers, find two numbers such that they add up to a specific target number.

Merge Intervals Problem Given a collection of intervals, merge all overlapping intervals. Example Given intervals => merged intervals: {代码...} Challenge O(n log n) time and O(1) extra space. Note 忘了这题怎么做，汗颜无地。 边界: size < 2 sort by Comparator<Interval> loop: merge &amp...

Given a 2D grid, each cell is either an house 1 or empty 0 (the number zero, one), find the place to build a post office, the distance that post office to all the house sum is smallest. Return the smallest distance. Return -1 if it is not possible.

If n is even, replace n with n/2.If n is odd, you can replace n with either n + 1 or n - 1.What is the minimum number of replacements needed for n to become 1?

Given two 1d vectors, implement an iterator to return their elements alternately.

Given a linked list and two values v1 and v2. Swap the two nodes in the linked list with values v1 and v2. It's guaranteed there is no duplicate values in the linked list. If v1 or v2 does not exist in the given linked list, do nothing.

Numbers keep coming, return the median of numbers at every time a new number added.

Given an array of n integer with duplicate number, and a moving window(size k), move the window at each iteration from the start of the array, find the maximum number inside the window at each moving.

User Accepted: 812User Tried: 861Total Accepted: 1362Total Submissions: 1552Difficulty: Easy

Pass by value: make a copy in memory of the actual parameter's value that is passed in.