# Counting Sort – step by step guide

### ðŸ‘‰ðŸ‘‰ðŸ‘‰ https://www.dyclassroom.com/sorting-algorithm/counting-sort

#sorting #algorithm #cs #computerscience #tutorial #dyclassroom

Skip to content
# Tag: video tutorial

# Counting Sort

# Counting Sort – step by step guide

### ðŸ‘‰ðŸ‘‰ðŸ‘‰ https://www.dyclassroom.com/sorting-algorithm/counting-sort

# Coin Changing Problem

# Click the link: “Coin Changing Problem“

### Read more…

# N Queen Problem

# Click the link: “N Queen Problem“

## Mission

## Watch the YouTube video

### Read more…

#sorting #algorithm #cs #computerscience #tutorial #dyclassroom

Advertisements

In this problem our goal is to make change for an amount using least number of coins from the available denominations.

Example

Say I went to a shop and bought 4 toffees. It cost me Rs. 4 in total. So, I gave Rs. 10 to the shopkeeper.

The shopkeeper had Rs. 1 coins, Rs. 2 coins and Rs. 5 coins with him.

Now, the goal is: The shopkeeper has to make change for Rs. 6 using least number of coins from the available denominations coins (1, 2 and 5)

Watch the YouTube video.

In this tutorial we will learn about N Queen Problem using backtracking.

If the chess board is of NxN size then our mission is to place N queens on the board such that each of them are at a safe position without getting attacked from other queens.