jhtong myrtleTree33

Technical Interview Cheat Sheet: Algorithms and Data Structures

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

	public class FlattenBstToLinkedList {

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

	import java.util.Arrays;

	public class NQueens {


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

	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));
	}

	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

	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}`);
	}

	package org.joeltong.test;

	import java.util.Arrays;

	public class QuickSort {


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