Binary search

.jest.config.json

@@ -2,7 +2,7 @@
     "clearMocks": true,
     "moduleNameMapper": {
         "@code/(.*)": [
-            "<rootDir>/src/day2/$1"
+            "<rootDir>/src/day1/$1"
         ]
     },
     "preset": "ts-jest"

package.json

@@ -14,13 +14,13 @@
         "typescript": "^4.7.4"
     },
     "scripts": {
-        "test": "jest PrimsList",
+        "test": "jest DFSOnBST LRU LinearSearchList BinarySearchList TwoCrystalBalls BubbleSort SinglyLinkedList DoublyLinkedList Queue Stack ArrayList MazeSolver QuickSort BTPreOrder BTInOrder BTPostOrder BTBFS CompareBinaryTrees DFSOnBST DFSGraphList Trie BFSGraphMatrix Map MinHeap",
         "clear": "node ./scripts/clear.js",
         "prettier": "prettier --write ./src",
         "generate": "node ./scripts/generate.js",
-        "day": "echo src/day4"
+        "day": "echo src\\day1"
     },
     "devDependencies": {
         "@swc-node/register": "^1.6.7"
     }
-}
+}

prettier.config.js

@@ -1,10 +1,8 @@
 module.exports = {
-    tabWidth: 4,
+    tabWidth: 2,
     printWidth: 80,
     proseWrap: "never",
     trailingComma: "all",
     singleQuote: false,
     semi: true,
 };
-
-

src/day1/ArrayList.ts

@@ -0,0 +1,27 @@
+export default class ArrayList<T> {
+    public length: number;
+
+
+
+    constructor() {
+    }
+
+    prepend(item: T): void {
+
+}
+    insertAt(item: T, idx: number): void {
+
+}
+    append(item: T): void {
+
+}
+    remove(item: T): T | undefined {
+
+}
+    get(idx: number): T | undefined {
+
+}
+    removeAt(idx: number): T | undefined {
+
+}
+}

src/day1/BFSGraphMatrix.ts

@@ -0,0 +1,3 @@
+export default function bfs(graph: WeightedAdjacencyMatrix, source: number, needle: number): number[] | null {
+
+}

src/day1/BTBFS.ts

@@ -0,0 +1,3 @@
+export default function bfs(head: BinaryNode<number>, needle: number): boolean {
+
+}

src/day1/BTInOrder.ts

@@ -0,0 +1,3 @@
+export default function in_order_search(head: BinaryNode<number>): number[] {
+
+}

src/day1/BTPostOrder.ts

@@ -0,0 +1,3 @@
+export default function post_order_search(head: BinaryNode<number>): number[] {
+
+}

src/day1/BTPreOrder.ts

@@ -0,0 +1,3 @@
+export default function pre_order_search(head: BinaryNode<number>): number[] {
+
+}

src/day1/BinarySearchList.ts

@@ -0,0 +1,29 @@
+export default function bs_list(haystack: number[], needle: number): boolean {
+  return search(haystack, 0, haystack.length, needle);
+}
+
+function search(
+  arr: number[],
+  low: number,
+  high: number,
+  needle: number,
+): boolean {
+  while (low < high) {
+    const middle = getMiddle(low, high);
+    const value = arr[middle];
+
+    if (value === needle) {
+      return true;
+    } else if (value > needle) {
+      high = middle;
+    } else {
+      low = middle + 1;
+    }
+  }
+  return false;
+}
+
+function getMiddle(low: number, high: number) {
+  let half = Math.floor(low + (high - low) / 2);
+  return half;
+}

src/day1/BubbleSort.ts

@@ -0,0 +1,3 @@
+export default function bubble_sort(arr: number[]): void {
+
+}

src/day1/CompareBinaryTrees.ts

@@ -0,0 +1,3 @@
+export default function compare(a: BinaryNode<number> | null, b: BinaryNode<number> | null): boolean {
+
+}

src/day1/DFSGraphList.ts

@@ -0,0 +1,3 @@
+export default function dfs(graph: WeightedAdjacencyList, source: number, needle: number): number[] | null {
+
+}

src/day1/DFSOnBST.ts

@@ -0,0 +1,3 @@
+export default function dfs(head: BinaryNode<number>, needle: number): boolean {
+
+}

src/day1/DoublyLinkedList.ts

@@ -0,0 +1,27 @@
+export default class DoublyLinkedList<T> {
+    public length: number;
+
+
+
+    constructor() {
+    }
+
+    prepend(item: T): void {
+
+}
+    insertAt(item: T, idx: number): void {
+
+}
+    append(item: T): void {
+
+}
+    remove(item: T): T | undefined {
+
+}
+    get(idx: number): T | undefined {
+
+}
+    removeAt(idx: number): T | undefined {
+
+}
+}

src/day1/LRU.ts

@@ -0,0 +1,15 @@
+export default class LRU<K, V> {
+    private length: number;
+
+
+
+    constructor() {
+    }
+
+    update(key: K, value: V): void {
+
+}
+    get(key: K): V | undefined {
+
+}
+}

src/day1/LinearSearchList.ts

@@ -0,0 +1,13 @@
+export default function linear_search(
+    haystack: number[],
+    needle: number,
+): boolean {
+    let result = false;
+    for (let i = 0; i < haystack.length; i++) {
+        if (haystack[i] === needle) {
+            result = true;
+            break;
+        }
+    }
+    return result;
+}

src/day1/Map.ts

@@ -0,0 +1,21 @@
+export default class Map<T extends (string | number), V> {
+
+
+
+
+    constructor() {
+    }
+
+    get(key: T): V | undefined {
+
+}
+    set(key: T, value: V): void {
+
+}
+    delete(key: T): V | undefined {
+
+}
+    size(): number {
+
+}
+}

src/day1/MazeSolver.ts

@@ -0,0 +1,3 @@
+export default function solve(maze: string[], wall: string, start: Point, end: Point): Point[] {
+
+}

src/day1/MinHeap.ts

@@ -0,0 +1,15 @@
+export default class MinHeap {
+    public length: number;
+
+
+
+    constructor() {
+    }
+
+    insert(value: number): void {
+
+}
+    delete(): number {
+
+}
+}

src/day1/Queue.ts

@@ -0,0 +1,18 @@
+export default class Queue<T> {
+    public length: number;
+
+
+
+    constructor() {
+    }
+
+    enqueue(item: T): void {
+
+}
+    deque(): T | undefined {
+
+}
+    peek(): T | undefined {
+
+}
+}

src/day1/QuickSort.ts

@@ -0,0 +1,3 @@
+export default function quick_sort(arr: number[]): void {
+
+}

src/day1/SinglyLinkedList.ts

@@ -0,0 +1,27 @@
+export default class SinglyLinkedList<T> {
+    public length: number;
+
+
+
+    constructor() {
+    }
+
+    prepend(item: T): void {
+
+}
+    insertAt(item: T, idx: number): void {
+
+}
+    append(item: T): void {
+
+}
+    remove(item: T): T | undefined {
+
+}
+    get(idx: number): T | undefined {
+
+}
+    removeAt(idx: number): T | undefined {
+
+}
+}

src/day1/Stack.ts

@@ -0,0 +1,18 @@
+export default class Stack<T> {
+    public length: number;
+
+
+
+    constructor() {
+    }
+
+    push(item: T): void {
+
+}
+    pop(): T | undefined {
+
+}
+    peek(): T | undefined {
+
+}
+}

src/day1/Trie.ts

@@ -0,0 +1,18 @@
+export default class Trie {
+
+
+
+
+    constructor() {
+    }
+
+    insert(item: string): void {
+
+}
+    delete(item: string): void {
+
+}
+    find(partial: string): string[] {
+
+}
+}

src/day1/TwoCrystalBalls.ts

@@ -0,0 +1,3 @@
+export default function two_crystal_balls(breaks: boolean[]): number {
+
+}

tsconfig.json

@@ -12,7 +12,7 @@
         "baseUrl": "src",
         "paths": {
             "@code/*": [
-                "day4/*"
+                "day1/*"
             ]
         }
     },
@@ -22,4 +22,4 @@
     "exclude": [
         "node_modules"
     ]
-}
+}

yarn.lock

@@ -592,15 +592,10 @@
     source-map-support "^0.5.21"
     tslib "^2.5.0"
 
-"@swc/core-linux-x64-gnu@1.3.80":
+"@swc/core-win32-x64-msvc@1.3.80":
   version "1.3.80"
-  resolved "https://registry.npmjs.org/@swc/core-linux-x64-gnu/-/core-linux-x64-gnu-1.3.80.tgz"
-  integrity sha512-+2e5oni1vOrLIjM5Q2/GIzK/uS2YEtuJqnjPvCK8SciRJsSl8OgVsRvyCDbmKeZNtJ2Q+o/O2AQ2w1qpAJG6jg==
-
-"@swc/[email protected]":
-  version "1.3.80"
-  resolved "https://registry.npmjs.org/@swc/core-linux-x64-musl/-/core-linux-x64-musl-1.3.80.tgz"
-  integrity sha512-8OK9IlI1zpWOm7vIp1iXmZSEzLAwFpqhsGSEhxPavpOx2m54kLFdPcw/Uv3n461f6TCtszIxkGq1kSqBUdfUBA==
+  resolved "https://registry.npmjs.org/@swc/core-win32-x64-msvc/-/core-win32-x64-msvc-1.3.80.tgz"
+  integrity sha512-2eZtIoIWQBWqykfms92Zd37lveYOBWQTZjdooBGlsLHtcoQLkNpf1NXmR6TKY0yy8q6Yl3OhPvY+izjmO08MSg==
 
 "@swc/core@>= 1.3", "@swc/core@>=1.2.50":
   version "1.3.80"