561. Array Partition I

Partitioning and sorting array with many repeated entries

Compute the integer square root

Compute the Levenshtein distance

Find the longest nondecreasing subsequence

Leetcode 80 Remove Duplicates from Sorted Array I

Dutch National Flag Problem/Can reach end

The knapsack problem

Compute the binomial coefficient

Search for a sequence in 2D array

Count the number of moves to climb stair

Minimum cost to travel from one station to another

Compute the right sibling tree

Write a program that computes exterior of binary tree

Calculate binary tree from preorder and inorder traversal

Reconstruct a binary tree from preorder traversal with mark

Implement an inorder traversal with o(1) space

Compute the kth node in an inorder traversal

Compute the successor

Implement locking in a binary tree

Sum the root-to-leaf paths in a binary tree

Find the longest subarray with distinct entries

Find the smallest subarray sequentially covering all values

Find the smallest subarray covering all values

Count the number of score combinations

Calculate fibonacci sequence number for given number n

Rectangle intersection

Check if a decimal integer is a palindrome

Reverse digits

Find a closest integer with the same weight

Reverse Bits

Swap Bits

Computer parity of words

Generate a program which returns all distinct binary trees with specified number of nodes

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. Each number in C may only be used once in the combination.

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.

Generate all subsets of size k

Implement a sudoku solver

Compute the diameter of a tree

Generate palindrom deompositions

Compute rows in Pascal's Triangle

Create list of leaf nodes in left to right order

Find a root to leaf path with specified sum

Compute the lowest common ancestor in a binary tree

Compute the LCA when nodes have parent pointers

Leet Code 75 Sort Color

Generate all nonattacking placements of queens

The tower of hanoi problem

Generate strings of matched parerns

Leetcode 259: Three sum smaller

Leetcode 167: Two Sum

LeetCode 15: Three Sum

LeetCode 229 Majority Elements 2

The gasup problem

The 3-Sum problem

The interval covering problem

Schedule for minimizing waiting time

Compute an optimum assignment of tasks

Imlement list pivoting

Test whether a singly linked list is palindromic

Implement even-odd merge

Implement cyclic right shift for singllly linked list

Reverse Linked List

Search for a pair-sum in an abs-sorted array

Trapping Water

Rotate a 2D array