myrtleTree33

[user]
	name = Joel Tong
	email = joel.tong@gmail.com
[core]
	editor = nvim
	ignorecase = false
[init]
	defaultBranch = main
[push]
	default = current

myrtleTree33

<div class="flex h-screen">
  <div class="m-auto">
    <h3>title</h3>
    <button>button</button>
  </div>
</div>

myrtleTree33

import java.util.ArrayList;
import java.util.List;

public class FlattenBstToLinkedList {

    static class Node {
        Node left;
        Node right;
        int val;
    }

myrtleTree33

import java.util.ArrayList;
import java.util.List;

public class ValidBST {

    public static class Node {
        Node left;
        Node right;
        int x;
    }

myrtleTree33

import java.util.Arrays;

public class NQueens {


    private static boolean nQueens(int[][] board, int col) {
        if (col >= board.length) {
            return true;
        }

myrtleTree33

import java.util.HashSet;
import java.util.Set;

public class LongestNonrepeatingSubstring {

    public static void main(String[] args) {
        String input = "pwwkew";
        System.out.println(longestNonrepeatingSubstr(input));
    }

myrtleTree33

import java.util.HashSet;
import java.util.Set;

public class Djistrika {

    public static final int V = 9;

    public static void dijkstra(int[][] graph, int ref) {

        // Initialize vars

myrtleTree33

const compose = (...fns) => fns.reduceRight(
    (prevFn, nextFn) => (...args) => nextFn(prevFn(...args)),
    value => value
);


const EatMixin = Superclass => class extends Superclass {
    eat(food) {
        console.log(`eating ${food}`);
    }

myrtleTree33

Technical Interview Cheat Sheet: Algorithms and Data Structures

Sorting algorithms

• Quicksort: https://gist.github.com/myrtleTree33/c92c3cc7a5a2ca9717dbf5a7e7195299
• Insertion Sort: https://gist.github.com/myrtleTree33/7b23aedf3f1424173b5b5685f623f33e
• Merge Sort: https://gist.github.com/myrtleTree33/330a7f85600587580ee3191947ee87dc

Selection algorithms

myrtleTree33

package org.joeltong.test;

import java.util.Arrays;

public class QuickSort {


  private static void quickSort(int[] arr) {
    quickSort(arr, 0, arr.length-1);
  }