- Understand use cases for stacks
Write a function that determines whether an input string has balanced brackets.
Understand adjacency list implementation of graphs
Write a function that determines if a path exists between two vertices of a directed graph.
The graph will be represented as an object, each of whose keys represents a vertex of the graph and whose value represents all vertices that can be reached from the aforementioned key.
| $ git remote rm origin | |
| $ git remote add origin git@github.com:aplikacjainfo/proj1.git | |
| $ git config master.remote origin | |
| $ git config master.merge refs/heads/master |
| //enumerable vs iterable | |
| //enumerable is a keyword in every object...and it's by default true | |
| //this means that if you loop through the object using a for...in, it all properties | |
| //will be looped through except where a property' enumerable is defined as false. | |
| //see below | |
| let log = console.log; | |
| let names =["Maxon","Moureen", "Kaihura-nkuba"]; |