Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

There is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this equation are satisfy to the following condition...

For given number N you must output amount of N-digit numbers, such, that last digits of their square is equal to 987654321.

Along the border between states A and B there are N defence outposts. For every outpost k, the interval [Ak,Bk] which is guarded by it is known. Because of fina...

Find amount of numbers for given sequence of integer numbers such that after raising them to the M-th power they will be divided by K.

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

Given two integers n and k, return all possible combinations of k numbers out of 1 … n.

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.