Given a set S, compute the powerset of S

Add two decimal strings representing two integers

Generate all the bit patterns from 0 to 2^(n-1) such that successive patterns differ by one bit.

Bellman-Ford – Given a graph G and a source vertex, find the shortest paths from the source src to all vertices. The graph may contain negative edges

Represent unsigned integers with variable length encoding using the continuation bit

Represent an integer with variable length encoding using gamma encoding

Represent an integer with variable length encoding using delta encoding

Jump Stairs – There is a stair with n steps. You can climb either one step or two steps at a time. How many different ways there are to climb the stair?

Compute the average with no division

Max sub-array problem - given an array of integers, compute the largest sum continuous sub array

Integer Knapsack – A knapsack has max capacity C and there are n items each with weight w[i] and value v[i]. Maximize the value in the knapsack without exceeding its max capacity

Edit Distance -– Given two strings, compute the edit distance between them

Neat Print – Given a sequence of words and a max number of words which can be put in a line, print the sequence of words neatly. Assume that no word is split across lines

Eggs Drop – Given k eggs and n floors in a building, find the minimum number of trials required to determine the lowest floor from which an egg can be dropped without getting broken

Jumping Array – Given an array of non-negative numbers, start at the first element and reach the end with a minimum number of jumps. A jump cannot exceed the length contained in the current position.

Dice -– Given n dice, count how many ways to get sum s.

Given n dollars, how many different ways there are to make the change into a set of coins S?

Longest Palindrome String – Given a string, compute the longest palindromic substring

LCS -– Given two strings S1 and S2, find the longest common substring

LCS -– Given two strings S1 and S2, find the longest common substring

String Palindromes -– Given a string, find the minimum number of characters to be inserted for converting the string into a palindrome

Jumping Array – Given an array of non-negative numbers, start at the first element and reach the end with a minimum number of jumps. A jump cannot exceed the length contained in the current position.

Given an array of integers, find the longest increasing subsequence

LCS – Given two strings, find the longest common subsequence

Bridge Matching – n cities are on the northern bank of a river and n cities are on the southern bank. You can build a bridge only between cities with the same number

LBS – Given an array of integers, find the longest bitonic sequence

Box Stacking – Given a set of 3d boxes, compute the largest stack of boxes. A box can be stacked only on top of another box with larger base.

Sum Subset -– Given an array of integers of size n, partition it in such a way that the two subsets have equal sum s

Partition Set – partition a multiset S of positive integers into two subsets S1 and S2, such that the sum of the numbers in S1 equals the sum of the numbers in S2

Segment Partition -– Given a segment of integer length n, cut it into different integer parts in such a way to maximize the product of the lengths of all parts

Cutting a Rod – given a rod of length n and a vector of prices for different lengths, cut the rod for maximizing the gain

CONVERTING A DOUBLE LINKED LIST INTO A BST

IMPLEMENTING FINDMIN AND FINDMAX IN A BS

IMPLEMENTING DELETENODE IN A BST

CONVERTING A DOUBLE LINKED LIST INTO A BST

Boolean Parenthesization – given a Boolean expression of and, or, xor, true, false, find the number of ways to parenthesize and evaluate to true

Matrix Parenthesization -- Given a set of m Matrices find the most efficient way of multiplying them

Maximum value contiguous subsequence – given an array of real numbers, find a contiguous subsequence with max sum s

MERGE TWO BALANCED BINARY SEARCH TREES

FIND IF THERE IS A TRIPLET IN A BALANCED BST THAT ADDS TO ZERO

IMPLEMENTING A B-TREE

Stock prices – Given a histogram array of unsigned integers encoding the price of a stock title during the previous year, compute the area for the largest rectangle contained in this histogram

Ship Battle – Given a matrix M and an array V, match the array in the matrix

Max Submatrix 0/1 - Given a matrix consisting only of 0s and 1s, find the maximum size square sub-matrix with all 1s

FINDING THE K-TH ELEMENT IN A BST

Balanced partition – given an array of integers between 0 and M, divide the integers into two sets such that the difference of their sums is minimized

COMPUTING THE DIAMETER OF A BINARY TREE

PRINTING ALL THE KEYS IN A BST WITHIN A GIVEN INTERVAL

IMPLEMENTING AN INORDER VISIT FOR A BINARY TREE

IMPLEMENTING A LEVEL ORDER VISIT FOR A BINARY TREE

CONVERTING A BST INTO A DOUBLE LINKED LIST

CHECKING IF TWO BINARY TREES ARE STRUCTURALLY IDENTICAL

VERIFYING IF A PATH SUM IS EQUAL TO AN INTEGER

PRINTING ALL THE PATHS IN A BINARY TREE

FIND THE MAXIMUM PATH SUM BETWEEN TWO LEAVES OF A BINARY TREE

PRINTING A ZIG-ZAG TRAVERSAL

IMPLEMENTING FIND AND INSERT IN A BINARY SEARCH TREE

IMPLEMENTING A SKIPLIST

PRINTING THE LOWEST COMMON ANCESTOR (LCA)

IMPLEMENTING FIND AND INSERT IN A BINARY SEARCH TREE

PRINT A BST IN ORDER

CHECK IF A TREE IS A BST

Microsoft - Elsevier to organize next WSDM cup

Glad to announce that Microsoft and Elsevier will organize the next wsdm cup. With @kuansan https://lnkd.in/bysr6QV 

In the recent explosive growth of online activities, the data are often recorded as heterogeneous graphs, ranging from Facebook’s Open Graph that record our social and communication activities to the graphs gathered by major search engine companies that represent a snapshot of our collective knowledge. As demonstrated in many web search and data mining applications, a critical element to make the best use of the data is the ability to assess the relative importance of the nodes.
In the 2016 WSDM Cup, the challenge will be to assess the query-independent importance of scholarly articles, using data from the Microsoft Academic Graph--a large heterogeneous graph comprised of publications, authors, venues, organizations, and the fields of study.

More details coming soon. Stay tuned.

Organizers
Alex Wade, Microsoft Research
Kuansan Wang, Microsoft Research
Antonio Gulli, Elsevier B.V.

IMPLEMENTING FINDMIN AND FINDMAX IN A BST

IMPLEMENTING A SKIPLIST

IMPLEMENTING TRIES

IMPLEMENTING A SEGMENT TREE

IMPLEMENTING RANGE MINIMUM QUERIES

Given a Binary Search Tree, find the size of the largest independent set of nodes

IMPLEMENTING A POSTORDER VISIT FOR A BINARY TREE

IMPLEMENTING SUFFIX TREE

Optimal Binary Tree – given a set S of tuples , where k is an integer and freq[k] is the number of times that k has been observed, build a binary search three such that the total cost of all single searches is minimized

COUNTING THE NUMBER OF LEAVES IN A TREE

Scheduling – given n jobs, each one with a processing time ti , a profit pi and a deadline di, maximize the profit

IMPLEMENTING A DIRECT GRAPH

ERDŐS NUMBER

CHOOSING MATRICES OR ADJACENCY LISTS

IMPLEMENTING A BFS VISIT

GIVEN TWO NODES IN AN UNDIRECTED GRAPH, FIND THE PATH CONNECTING THEM

HOW TO DETECT A CYCLE IN A GRAPH

IMPLEMENTING A DFS VISIT

RECONSTRUCTING A TREE GIVEN ITS PRE-ORDER AND IN-ORDER TRAVERSALS

IMPLEMENTING PREORDER VISIT FOR A BINARY TREE

SOLVING MAZES

GIVEN A CONNECTED GRAPH, COMPUTE THE MINIMUM SPANNING TREE (MST)

DETECTING A BIPARTITE GRAPH

GIVEN A DIRECT ACYCLIC GRAPH, IMPLEMENT A TOPOLOGICAL SORT

COVERING DFS TREES

COVERING DFS TREES

FIND AN HAMILTONIAN CYCLE

FIND THE SHORTEST PATH IN A GRAPH WITH NON-NEGATIVE EDGE WEIGHT

FIND THE ARTICULATION POINTS IN A GRAPH

Games of Coins – a set of coins are aligned and two players can pick one coin from each side in turn. Maximize the value of the coins picked by the first player

FIND THE SHORTEST PATH IN A GRAPH WITH NON-NEGATIVE EDGE WEIGHT

FIND MST(MINIMUM SPANNING TREE) USING KRUSKAL ALGORITHM

FIND THE LONGEST PATH IN A DAG

Teaching computer science to more than 100 kids during the last years

During the last year, I spent time teaching computer science to kids between 8-13 years old. It is volunteer activity in part inspired by the code.org initiative. I spend few hours teaching how to program video games by using Microsoft Research's Kodu environment and the children are enthusiastic also because they can share the game with other kids worldwide thanks to the online community

Then i explain the meaning of Fibonacci numbers and the different places where they occur in nature

Then i discuss the problem of sorting by playing this game

A Collection of Graph Programming Interview Questions Solved in C++

The new book is almost ready

A Collection of Graph Programming Interview Questions Solved in C++

FIND MST (MINIMUM SPANNING TREE) USING PRIM ALGORITHM

FIND ALL THE SINGLE SOURCE SHORTEST PATHS USING BELLMAN FORD ALGORITHM