afdon

const categories = [
  {
    name: "All",
    slug: "all",
  },
  {
    name: "Business & Money",
    color: "#FFB347",
    slug: "business-money",
    subcategories: [

afdon

# add functions
    # delete first occurrence of a value - done.
    # insert a new node with a value - done.
    # add traversal - done
# add error checks - done
# ready

import ctypes

n1 = [1, None]

afdon

# Merge Sort: Divide and Conquer

aList = [43, 5, 23, 1, 32, 4, 90, 36, 8, 10]

def find_mid(array):
    midpoint = len(array)//2
    return midpoint

def array_left(array):

afdon

aList = [43, 5, 23, 1, 32, 4, 90, 36, 8]

for x in range(1, len(aList)):
    current = aList[x]

    y = x - 1 # prev (end of sorted list)

    while y >= 0 and aList[y] < current: # from 0 to y
        aList[y + 1] = aList[y] # move each up
        y = y - 1

afdon

class TrieNode {
    public children: TrieNode[]
    public isEndOfWord: boolean
    public value: string | null

    constructor() {
        this.children = [];
        this.isEndOfWord = false;
        this.value = null;
    }