jsmney

import React, {useState, useEffect} from 'react'

const BirdSanctuary = props => {
  const [birds, setBirds] = useState([])
  
  useEffect(()=>{
    setBirds(props.getBirds())
  },[])
  
  const feedBird = birdId => {

jsmney

import React from 'react'

const SingleBird = props => {
  return (
    <div className="singleBird">
      <h3>{props.bird.name}</h3>
      <p>{props.bird.fed ? 'I have been fed!' : 'I need some food'}</p>
      <button onClick={() => props.feedBird(props.bird.id)}>Feed</button>
    </div>
  )

jsmney

import React, {useState, useEffect} from 'react'

const BirdSanctuary = props => {
  // for example's sake, here is a default array of birds
  const [birds, setBirds] = useState([
    {id: 3, name: 'Polly', fed: false},
    {id: 4, name: 'Tina', fed: true},
    {id: 5, name: 'Marlow', fed: false}
  ])
  

jsmney

jsmney

Introduction

Let's take a look at one of the best classic games!

(https://www.youtube.com/watch?v=ia8bhFoqkVE "Super Mario Bros Gameplay") (Watch from 0:00 - 1:00)

If you already understand the basics of how Super Mario works, feel free to skip to the prompt!

jsmney

Introduction

Let's take a look at one of the best classic games!

(https://www.youtube.com/watch?v=ia8bhFoqkVE "Super Mario Bros Gameplay") (Watch from 0:00 - 1:00)

If you already understand the basics of how Super Mario works, feel free to skip to the prompt!

jsmney

Prompt

Given a staircase with a given number of stairs, num, write a function that returns the number of different ways one can climb this set of stairs. A person is able to climb the stairs either one at a time, or skip a step, or a mix of both.

Examples

climbStairs(2); // should return 2: one step at a time (1 + 1), or skip a step (2).
climbStairs(0); // should return 1
climbStairs(1); // should return 1
climbStairs(5); // should return 8
climbStairs(100); // should return 573147844013817200640

jsmney

Graph Path Checker

Prompt

Write a function that determines if a path exists between two vertices of a directed graph.

Recall that a graph is a collection of connections, or 'edges', linking together nodes or verticies. In a directed graph, each edge is like an arrow or a one-way street-- an edge linking A to B indicates that A connects to B, but not that B connects to A.

The graph passed to the function will be represented as an object with a structure sometimes called an 'adjacency list' or 'adjacency map', in which each key represents a node in the graph, and each value will consist in an array of nodes which can be reached from the key. For example, the following object:

jsmney

Prompt

Write a function that determines whether an input string has balanced brackets.

You are given an input string consisting of brackets—square [ ], round ( ), and curly { }. The input string can include other text. Write a function that returns either true if the brackets in the input string are balanced or false if they are not. Balanced means that any opening bracket of a particular type must also have a closing bracket of the same type.

An empty input string or a string without brackets can also be considered "balanced".

Examples

jsmney

Act II:

Romeo lingers near the Capulet house to talk with Juliet when she appears in her window. The pair declare their love for one another and intend to marry the next day. With the help of Juliet's Nurse, the lovers arrange to marry when Juliet goes for confession at the cell of Friar Laurence. There, they are secretly married (talk about a short engagement).