bsihame Goto Github PK

pursuit-core-web-server-intro-lab

pursuit-core-web-sql-lab

pursuit-core-web-text-based-adventure-project

pursuit-core-web-twitter-css-assignment

pursuit-core-web-unit-1-review

pursuit-core-web-unit-2-assessment-6-4

react

react-calculator

react-clock-with-hooks

Create Clock wit react hooks

react-intro

react-ratings-demo

Rating Component using starts

react-redux-fruit-stand

react_context_lab

react_pokemon

reactchat

recipe-app-with-react

Using APIs in React - Create a Recipe Application using React Router | React tutorial for beginners

relax_start_app

restfulapi_exercise

reviw-unit-3

NodeJS, Express, and SQL

shopping_list_app

sihamebaziportfolio

string_assignment

test1

practice

todo

togglereviewapp

towers_hanoi

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower[1] and sometimes pluralized as Towers) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: Only one disk can be moved at a time. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. No larger disk may be placed on top of a smaller disk. With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.

triphikers

A React hooks application allows users to connect travelers who want to travel with others and explore new places.

unit4practiceassessmentvideoapp

values_types_operators_assignment

web-functions-and-objects-review