Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

A message containing letters from A-Z is being encoded to numbers using the following mapping:

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 an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.In a UNIX-style file system, a period . refers to the current directory. Furthermore…

Given a linked list, rotate the list to the right by k places, where k is non-negative.

A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).

Given a collection of intervals, merge all overlapping intervals.

A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the b…

Given a collection of numbers that might contain duplicates, return all possible unique permutations.Example:

Given a collection of distinct integers, return all possible permutations.