alihassan89 Goto Github PK

3sumclosesttotarget

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.

4sumtotarget

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

addtwonumbersinlist

allpathsfromroottoleafinbinarytree

Given a binary tree, return all paths from the root to leaves.

allpathsfromroottoleave

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

anagrams

as3-ponggame

2D Pong game

binarysearchtreeandlinkedlist

binarytree-firstcommonancestor

First Common Ancestor: Design an algorithm and write code to find the first common ancestor

binarytreeisbinarysearchtree

Write a method to check if a binary tree is a binary search tree

bitmapsort_o-n-_sorting_algo

brackets

Check for balanced parentheses

breadthfirstsearchdijkstra

The program is implementation of Breadth first search using Dijkstra algorithm.

bst-of-min-height

Minimal Tree: Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.

bst-secondlargestelement

Write a method to find the 2nd largest element in a binary search tree

buildorder-topologicalsort

Build Order: You are given a list of projects and a list of dependencies (which is a list of pairs...

cakethief-0-1-knapsack

The problem is solved using dynamic programming using 0-1 Knapsack approach.

checkpermutation

checksubtree

Check Subtree: Tl and T2 are two very large binary trees, with Tl much bigger than T2. Create an algorithm to determine...

chesslibrary

Create the necessary Java classes to implement a chess board (e.g. ChessBoard.java, Piece.java, etc...)

cloneundirectedgraph-using-dfs

closestlocker

closestvegetarianrestaurants

Given an array representing the locations of N vegetarian restaurants in the city

combinationsum

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.

combinationsumnonrepeating

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.

construct-quad-tree

We want to use quad trees to store an N x N boolean grid. Each cell in the grid can only be true or false.

container-with-most-water

Find two lines, which together with x-axis forms a container, such that the container contains the most water.

countandsay

The count-and-say sequence is the sequence of integers beginning as follows:

countpaths_dynamicprogramming

You are given a grid of cells with size N rows by M columns. A robot is situated at the bottom-left cell. Task is to reach top right.

decryptmessage

Encrypted messages consist of lowercase latin letters only, and every word is encrypted separately as follows