SYMBOL INDEX (246 symbols across 45 files)

FILE: Algorithms/DynamicProgramming/Basics.ts
  class MemoizationExample (line 2) | class MemoizationExample {
    method resetCache (line 5) | public static resetCache() {
    method memoizedAddTo42 (line 10) | public static memoizedAddTo42(n: number, visualize?: boolean): number {
    method addTo42 (line 21) | public static addTo42(n: number): number {
  function memoizedAddTo64 (line 28) | function memoizedAddTo64() {

FILE: Algorithms/DynamicProgramming/Fibonacci.ts
  class FibonacciMemoized (line 4) | class FibonacciMemoized {
    method nthTerm (line 12) | public static nthTerm(nth: number): number {
  function fibonacciBottomUp (line 22) | function fibonacciBottomUp() {
  function executionTime (line 36) | function executionTime(n: number): string {

FILE: Algorithms/Recursion/Basics.ts
  function inception (line 1) | function inception(repeat: number): string {

FILE: Algorithms/Recursion/Factorial.ts
  function calcFactorialRecursive (line 1) | function calcFactorialRecursive(input: number): number {
  function calcFactorialIterative (line 7) | function calcFactorialIterative(input: number): number | undefined {
  function validateFactorialInput (line 19) | function validateFactorialInput(input: number): boolean {
  function printIterativeFactorial (line 23) | function printIterativeFactorial(input: number) {
  function printRecursiveFactorial (line 31) | function printRecursiveFactorial(input: number) {

FILE: Algorithms/Recursion/Fibonacci.ts
  function fibonacciRecursive (line 5) | function fibonacciRecursive(nthElement: number): number | any {
  function fibonacciIterative (line 17) | function fibonacciIterative(nthElement: number): number | undefined {
  function validateFibonacciInput (line 38) | function validateFibonacciInput(nthElement: number) {
  function printFibonacciIterative (line 42) | function printFibonacciIterative(nthElement: number) {
  function printFibonacciRecursive (line 46) | function printFibonacciRecursive(nthElement: number) {

FILE: Algorithms/Searching/BreadthFirstTraversal.ts
  function recursiveBFT (line 5) | function recursiveBFT(nodeQueue: Queue<Node>, nodesTraversed: Array<numb...
  function breadthFirstTraversal (line 16) | function breadthFirstTraversal(tree: BST) {

FILE: Algorithms/Searching/DepthFirstTraversals.ts
  function inorderDFT (line 5) | function inorderDFT(tree: BST) {
  function preorderDFT (line 26) | function preorderDFT(tree: BST) {
  function postorderDFT (line 47) | function postorderDFT(tree: BST) {

FILE: Algorithms/Sorting/BubbleSort.ts
  function bubbleSort (line 1) | function bubbleSort(numbersArr: Array<number>) {
  function bubbleSortStrings (line 15) | function bubbleSortStrings(stringArr: Array<string>) {

FILE: Algorithms/Sorting/InsertionSort.ts
  function insertionSort (line 3) | function insertionSort(inputArr: number[] | string[]) {
  function executionTime (line 51) | function executionTime(method: any): string {

FILE: Algorithms/Sorting/MergeSort.ts
  function merge (line 1) | function merge(left: any[], right: any[]): Array<any> {
  function mergeSort (line 25) | function mergeSort(inputArr: string[] | number[]): Array<any> {

FILE: Algorithms/Sorting/QuickSort.ts
  function swap (line 7) | function swap(array: Array<any>, pos1: number, pos2: number) {
  function partition (line 14) | function partition(array: Array<any>, pivotIndex: number, leftBound: num...
  function quickSort (line 35) | function quickSort(array: number[] | string[], leftBound: number, rightB...

FILE: Algorithms/Sorting/SelectionSort.ts
  function swap (line 1) | function swap(pos1: number, pos2: number, inputArr: Array<any>): void {
  function selectionSort (line 7) | function selectionSort(inputArr: Array<number> | Array<string>): Array<a...

FILE: Big-O/Ex1.ts
  function anotherFunction (line 3) | function anotherFunction() {
  function funChallenge (line 7) | function funChallenge(input: Array<any>): number {

FILE: Big-O/Ex2.ts
  function anotherFunChallenge (line 3) | function anotherFunChallenge(input: number): void {

FILE: Big-O/Hello_Big_O.ts
  function findNemo (line 6) | function findNemo(fishes: Array<string>): string {
  function getFirstFish (line 24) | function getFirstFish(fishes: Array<string>) {

FILE: Big-O/Rule3.ts
  function compressBoxes (line 3) | function compressBoxes(fullBoxes: Array<string>, emptyBoxes: Array<strin...

FILE: Big-O/n_squared.ts
  function logAllPairs (line 5) | function logAllPairs(array: Array<any>): void {
  function printNumbersThenPairSums (line 13) | function printNumbersThenPairSums(numbers: Array<number>): void {

FILE: Data-Structures/Arrays/MyArray.ts
  type NumIndexedObject (line 1) | type NumIndexedObject = { [index: number]: any };
  class MyArray (line 3) | class MyArray<T> {
    method constructor (line 8) | constructor() {
    method get (line 18) | public get(index: number): T | null {
    method push (line 31) | public push(item: T): number {
    method pop (line 42) | public pop(): T | null {
    method deleteIndex (line 59) | public deleteIndex(index: number): T | null {
    method insertItemAtIndex (line 77) | public insertItemAtIndex(index: number, item: T): number | null {
    method _shiftItemsLeftAfterIndex (line 87) | private _shiftItemsLeftAfterIndex(index: number): void {
    method _shiftItemsRightAtIndex (line 96) | private _shiftItemsRightAtIndex(index: number): void {

FILE: Data-Structures/Graphs/SimpleGraph.ts
  type StrIndexedObject (line 1) | type StrIndexedObject = { [index: string]: Set<string> };
  class SimpleGraph (line 4) | class SimpleGraph {
    method constructor (line 8) | constructor() {
    method getNodeCount (line 13) | public getNodeCount(): number {
    method addVertex (line 17) | public addVertex(node: string) {
    method addEdge (line 22) | public addEdge(node1: string, node2: string) {
    method toString (line 28) | public toString(): string {
  function printGraph (line 48) | function printGraph(graph: SimpleGraph) {

FILE: Data-Structures/Hash-Tables/HashTable.ts
  class HashTable (line 1) | class HashTable {
    method constructor (line 5) | constructor(numBuckets: number) {
    method insert (line 10) | public insert(key: string, value: any): void {
    method get (line 20) | public get(key: string): any {
    method keys (line 33) | public keys(): string[] {
    method values (line 51) | public values(): string[] {
    method getSize (line 65) | public getSize(): number {
    method _hash (line 69) | private _hash(key: string) {
    method testHashFunction (line 80) | public testHashFunction() {

FILE: Data-Structures/Linked-Lists/DoublyLinkedList.ts
  class DoublyLinkedList (line 3) | class DoublyLinkedList<T> {
    method constructor (line 8) | constructor() {
    method getLength (line 14) | public getLength(): number {
    method isEmpty (line 18) | public isEmpty(): boolean {
    method append (line 22) | public append(value: T, demo?: boolean): boolean {
    method prepend (line 44) | public prepend(value: T, demo?: boolean): boolean {
    method insert (line 65) | public insert(value: T, atIndex: number, demo?: boolean): boolean | nu...
    method getValueAtIndex (line 98) | public getValueAtIndex(index: number): T | null {
    method searchFor (line 113) | public searchFor(value: T): number | null {
    method empty (line 128) | public empty(nestedCall?: boolean): boolean {
    method removeElementAtIndex (line 135) | public removeElementAtIndex(index: number, demo?: boolean): T | null {
    method _traverseToNode (line 173) | private _traverseToNode(index: number): Node<T> | null {
    method toString (line 195) | public toString(nodesPerGroup?: number): string {
  function printLinkedList (line 220) | function printLinkedList(linkedList: DoublyLinkedList<any>): void {
  function printSearchFor (line 228) | function printSearchFor(value: any, linkedList: DoublyLinkedList<any>): ...
  function printGetValueAtIndex (line 232) | function printGetValueAtIndex(index: number, linkedList: DoublyLinkedLis...

FILE: Data-Structures/Linked-Lists/DoublyNode.ts
  class DoublyLLNode (line 1) | class DoublyLLNode<T> {
    method constructor (line 6) | constructor(value: T) {
    method setValue (line 12) | public setValue(value: T) {
    method setNext (line 16) | public setNext(node: DoublyLLNode<T> | null) {
    method setPrevious (line 20) | public setPrevious(node: DoublyLLNode<T> | null) {
    method getValue (line 24) | public getValue(): T {
    method getNext (line 28) | public getNext(): DoublyLLNode<T> | any {
    method getPrevious (line 32) | public getPrevious(): DoublyLLNode<T> | any {
    method hasNext (line 36) | public hasNext(): boolean {
    method hasPrevious (line 40) | public hasPrevious(): boolean {
    method toString (line 44) | public toString(): string {

FILE: Data-Structures/Linked-Lists/LinkedList.ts
  class LinkedList (line 3) | class LinkedList<T> {
    method constructor (line 8) | constructor() {
    method getLength (line 14) | public getLength(): number {
    method getHeadValue (line 18) | public getHeadValue(): T | any {
    method getTailValue (line 22) | public getTailValue(): T | any {
    method isEmpty (line 26) | public isEmpty(): boolean {
    method empty (line 33) | public empty(): boolean {
    method append (line 40) | public append(value: T): boolean {
    method prepend (line 56) | public prepend(value: T): boolean {
    method insert (line 71) | public insert(value: T, atIndex: number): boolean | null {
    method removeElementAtIndex (line 93) | public removeElementAtIndex(index: number): T | null {
    method getValueAtIndex (line 113) | public getValueAtIndex(index: number): T | null {
    method searchFor (line 128) | public searchFor(value: T): number | null {
    method _traverseToNode (line 140) | private _traverseToNode(index: number): Node<T> | null {
    method reverse (line 152) | public reverse(): boolean {
    method toArray (line 177) | public toArray(): Array<T> | any {
    method toString (line 191) | public toString(nodesPerGroup?: number): string {
  function printLinkedList (line 216) | function printLinkedList(linkedList: LinkedList<any>): void {
  function printSearchFor (line 224) | function printSearchFor(value: any, linkedList: LinkedList<any>): void {
  function printGetValueAtIndex (line 228) | function printGetValueAtIndex(index: number, linkedList: LinkedList<any>) {
  function printRemoveIndex (line 232) | function printRemoveIndex(index: number, linkedList: LinkedList<any>) {

FILE: Data-Structures/Linked-Lists/SinglyNode.ts
  class LinkedListNode (line 1) | class LinkedListNode<T> {
    method constructor (line 5) | constructor(value: T) {
    method setValue (line 10) | public setValue(value: T) {
    method setNext (line 14) | public setNext(nextNode: LinkedListNode<T> | null) {
    method getValue (line 18) | public getValue(): T {
    method getNext (line 22) | public getNext(): LinkedListNode<T> | any {
    method hasNext (line 26) | public hasNext(): boolean {
    method toString (line 30) | public toString(): string {

FILE: Data-Structures/Sequential/Queue.ts
  class Queue (line 4) | class Queue<T> {
    method constructor (line 9) | constructor() {
    method getLength (line 15) | public getLength(): number {
    method isEmpty (line 19) | public isEmpty(): boolean {
    method peek (line 23) | public peek(): T | null {
    method enqueue (line 27) | public enqueue(value: T): boolean {
    method dequeue (line 43) | public dequeue(): T | any {
  function printQueue (line 58) | function printQueue(queue: Queue<any>) {
  function printPeekQueue (line 62) | function printPeekQueue(queue: Queue<any>) {
  function printDequeue (line 66) | function printDequeue(queue: Queue<any>) {

FILE: Data-Structures/Sequential/Stack.ts
  class Stack (line 1) | class Stack<T> {
    method constructor (line 5) | constructor() {
    method getLength (line 10) | public getLength(): number {
    method isEmpty (line 14) | public isEmpty(): boolean {
    method peek (line 18) | public peek(): T | null {
    method push (line 22) | public push(value: T): boolean {
    method pop (line 28) | public pop() {
  function printStack (line 36) | function printStack(stack: Stack<any>) {
  function printPopStack (line 40) | function printPopStack(stack: Stack<any>) {
  function printPeekStack (line 44) | function printPeekStack(stack: Stack<any>) {

FILE: Data-Structures/Sequential/StackLL.ts
  class StackLL (line 4) | class StackLL<T> {
    method constructor (line 9) | constructor() {
    method getLength (line 15) | public getLength(): number {
    method isEmpty (line 19) | public isEmpty(): boolean {
    method peek (line 23) | public peek(): T | null {
    method push (line 27) | public push(value: T): boolean {
    method pop (line 51) | public pop(): T | null {
  function printStack (line 69) | function printStack(stack: StackLL<any>) {
  function printPopStack (line 73) | function printPopStack(stack: StackLL<any>) {
  function printPeekStack (line 77) | function printPeekStack(stack: StackLL<any>) {

FILE: Data-Structures/Trees/BinarySearchTree.test.ts
  method fn (line 14) | fn() {
  method fn (line 31) | fn() {

FILE: Data-Structures/Trees/BinarySearchTree.ts
  class BinarySearchTree (line 5) | class BinarySearchTree {
    method traverse (line 7) | public static traverse(node: BNode | null) {
    method constructor (line 21) | constructor() {
    method getRoot (line 25) | public getRoot(): BNode | null {
    method insert (line 29) | public insert(value: number) {
    method lookup (line 64) | public lookup(value: number): BNode | null {
    method remove (line 97) | public remove(value: number): boolean {
    method invertTree (line 189) | public invertTree(): boolean {
    method _invertNode (line 195) | private _invertNode(current: BNode | null) {
    method _swapChildren (line 203) | private _swapChildren(node: BNode) {
    method breadthFirstTraversal (line 209) | public breadthFirstTraversal() {
    method equalsQuantum (line 227) | public equalsQuantum(tree: BinarySearchTree): boolean {
  function printNode (line 232) | function printNode(tree: BinarySearchTree, value: number): void {

FILE: Data-Structures/Trees/BinaryTreeNode.ts
  class BinaryTreeNode (line 1) | class BinaryTreeNode {
    method constructor (line 6) | constructor(value: number) {
    method setValue (line 12) | public setValue(value: number) {
    method setLeft (line 16) | public setLeft(binaryTreeNode: BinaryTreeNode) {
    method setRight (line 20) | public setRight(binaryTreeNode: BinaryTreeNode) {
    method getValue (line 24) | public getValue(): number {
    method getLeft (line 28) | public getLeft(): BinaryTreeNode | any {
    method getRight (line 32) | public getRight(): BinaryTreeNode | any {
    method hasLeft (line 36) | public hasLeft(): boolean {
    method hasRight (line 41) | public hasRight(): boolean {

FILE: Playground/Demos/Classes_101.ts
  class Bender (line 3) | class Bender {
    method constructor (line 8) | constructor(name: string, isFemale: boolean, element: string) {
    method introduce (line 16) | public introduce() {
  class EarthBender (line 21) | class EarthBender extends Bender {
    method constructor (line 24) | constructor(name: string, isFemale: boolean, specialty?: string) {
    method earthbend (line 31) | public earthbend() {

FILE: Playground/Interviews/HealthcareHM.ts
  function findNumOccurrences (line 1) | function findNumOccurrences(color: string, colorsArr: string[]): number {
  function unique (line 13) | function unique(array: Array<number> | Array<string>): boolean {

FILE: Playground/Puzzles/AngryFrogs.test.ts
  method fn (line 14) | fn() {
  method fn (line 24) | fn() {

FILE: Playground/Puzzles/AngryFrogs.ts
  function maxDistance (line 1) | function maxDistance(lilypadHeights: number[]) {
  class Solution (line 6) | class Solution {
    method initializeLilypadForest (line 10) | static initializeLilypadForest(lilypadHeights: number[]) {
    method findMaxDistance (line 14) | static findMaxDistance(): number {
    method _travelRightFrom (line 38) | private static _travelRightFrom(index: number): number {
    method _travelLeftFrom (line 48) | private static _travelLeftFrom(index: number): number {

FILE: Playground/ZTM Challenges/Arrays/Compare_Arrays.test.ts
  method fn (line 17) | fn() {
  method fn (line 24) | fn() {
  method fn (line 31) | fn() {

FILE: Playground/ZTM Challenges/Arrays/Compare_Arrays.ts
  function containsCommonItemBF (line 17) | function containsCommonItemBF(arr1: Array<string>, arr2: Array<string>):...
  function containsCommonItem (line 29) | function containsCommonItem(arr1: Array<string>, arr2: Array<string>): b...
  function containsCommonItemSyntacticSugar (line 50) | function containsCommonItemSyntacticSugar(arr1: Array<string>, arr2: Arr...

FILE: Playground/ZTM Challenges/Arrays/Merge_Sorted_Arrays.ts
  function mergeSortedArrays (line 9) | function mergeSortedArrays(arr1: number[], arr2: number[]): Array<number...

FILE: Playground/ZTM Challenges/Arrays/Reverse_String.ts
  function reverseString (line 8) | function reverseString(input: string): string {
  function reverseWithJavascriptVoodoo (line 20) | function reverseWithJavascriptVoodoo(input: string): string {

FILE: Playground/ZTM Challenges/Arrays/Sum_Pair.ts
  function hasPairWithSumBF (line 6) | function hasPairWithSumBF(arr: number[], sum: number): boolean {
  function hasPairWithSum (line 20) | function hasPairWithSum(arr: number[], sum: number) {

FILE: Playground/ZTM Challenges/Hash-Tables/Recurring_Symbol.test.ts
  method fn (line 22) | fn() {
  method fn (line 30) | fn() {
  method fn (line 38) | fn() {
  method fn (line 46) | fn() {
  method fn (line 54) | fn() {

FILE: Playground/ZTM Challenges/Hash-Tables/Recurring_Symbol.ts
  function firstRecurringNumber (line 23) | function firstRecurringNumber(numArray: number[]): number | undefined {
  function findFirstRecurring (line 41) | function findFirstRecurring(arr: number[] | string[]): number | string |...

FILE: Playground/ZTM Challenges/Josephus.ts
  class Josephus (line 1) | class Josephus {
    method constructor (line 6) | constructor(numSoldiers: number) {
    method setNumSoldiers (line 12) | public setNumSoldiers(numSoldiers: number) {
    method getNumSoldiers (line 17) | public getNumSoldiers(): number {
    method reset (line 21) | public reset(): void {
    method solveBF (line 26) | public solveBF(): number {
    method solveVisual (line 44) | public solveVisual(): number {
    method _findNextLiving (line 76) | private _findNextLiving(index: number): number {
    method _findThirdLiving (line 84) | private _findThirdLiving(index: number): number {
    method _markDead (line 99) | private _markDead(index:number): number {
  function printJosephusSolution (line 106) | function printJosephusSolution(circleOfKnights: Josephus) {

FILE: Playground/ZTM Challenges/Recursion/ReverseString.ts
  function reverseStringRecursive (line 1) | function reverseStringRecursive(str: string): string {
  function printReverseString (line 7) | function printReverseString(str: string) {

FILE: Playground/ZTM Challenges/StackifiedQueue.ts
  class StackifiedQueue (line 5) | class StackifiedQueue<T> {
    method constructor (line 10) | constructor() {
    method getlength (line 16) | public getlength(): number {
    method isEmpty (line 20) | public isEmpty(): boolean {
    method enqueue (line 24) | public enqueue(value: T): boolean {
    method dequeue (line 36) | public dequeue(): T | null {
    method peek (line 45) | public peek(): T | null {
    method _populateFirstOnTop (line 51) | private _populateFirstOnTop(): void {
    method _populateLastOnTop (line 59) | private _populateLastOnTop(): void {
  function printQueue (line 68) | function printQueue(queue: StackifiedQueue<any>) {
  function printPeekQueue (line 72) | function printPeekQueue(queue: StackifiedQueue<any>) {
  function printDequeue (line 76) | function printDequeue(queue: StackifiedQueue<any>) {

FILE: Playground/ZTM Challenges/ValidatorBST.ts
  class BinarySearchTreeValidator (line 4) | class BinarySearchTreeValidator {
    method _resetValidator (line 7) | private static _resetValidator() {
    method validate (line 11) | public static validate(tree: BST, visualize?: boolean): boolean {
    method _traverseInOrder (line 24) | private static _traverseInOrder(node: Node, visualize: boolean): boole...
  function printBSTValidation (line 40) | function printBSTValidation(tree: BST, treeLabel: string) {