Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Branch and Bound

8 puzzle Problem using Branch And Bound

We have introduced Branch and Bound and discussed 0/1 Knapsack problem in below posts. Branch and Bound | Set 1 (Introduction with 0/1 Knapsack) Branch and Bound | S...
Dynamic Programming Egg-Dropping Dynamic Programming

Egg Dropping Puzzle DP-11

The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors. Suppose that we wish to know which stories i...
Advanced Data Structure

Decision Trees – Fake (Counterfeit) Coin Puzzle (12 Coin Puzzle)

Let us solve the classic “fake coin” puzzle using decision trees. There are the two different variants of the puzzle given below. I am providing descrip...
Arrays Mathematical Accolite

A Product Array Puzzle

Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that prod[i] is equal to the product of all the elements of arr[] except arr[...

Subscribe to Our Newsletter