jianminchen

class TreeNode:
    def __init__(self, val):
        self.left = None
        self.right = None
        self.val = val

def get_binary_tree(l, r, postorder):
    if not inorder[l:r]: return None
    
    root = TreeNode(postorder.pop()) # 3  - last one in stack, l, r value

jianminchen

2:51 PM

How would you build a website for a bakery?

Breakfast foods, croissants, bread
Category - website 
10 - 20 people max a day 
20 - 30 products 
Category  - price, product in detail <- 
Should write down - 

jianminchen

class Solution {
    int a = 26, mod = 1<<30;
    public String longestDupSubstring(String S) {
        int lo = 1, hi = S.length()-1;
        while(lo<=hi){
            int mid = lo+(hi-lo)/2, startIndex = search(S,mid);
            if(startIndex==-1){
                hi = mid-1;
            }
            else{

jianminchen

using System;

// To execute C#, please define "static void Main" on a class
// named Solution.

class Solution
{
    static void Main(string[] args)
    {
        for (var i = 0; i < 5; i++)

jianminchen

public IList<IList<int>> FourSum(int[] nums, int target) {
        if(nums == null || nums.Length < 4 )
            return new List<IList<int>>(); 
        
        var fourNumbers = new List<IList<int>>(); 
        
        Array.Sort(nums);
        
        var length = nums.Length; 
        for(int i = 0; i < length - 3; i++)

jianminchen

import java.io.*;
import java.util.*;

class Solution {
  public static void main(String[] args) {
    ArrayList<String> strings = new ArrayList<String>();
    strings.add("Hello, World!");
    strings.add("Welcome to CoderPad.");
    strings.add("This pad is running Java " + Runtime.version().feature());

jianminchen

import java.io.*;
import java.util.*;

/*
 You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.

Grid cells are connected horizontally/vertically (not diagonally). The grid is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).

The island doesn't have "lakes" (water inside that isn't connected to the water around the island). One cell is a square with side length 1. The grid is rectangular, width and height don't exceed 100. Determine the perimeter of the island.

jianminchen

 7:03 PM
Intention
Communication, ask clarification, brute force -> optimal, run test cases - simple, catch all bugs
Do not fake testing… 
7:06 PM 
414. Third Maximum Number
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).

Array - not distinct 
[1, 1, 2,2, 3] - third maximum number 

jianminchen

using System;

// To execute C#, please define "static void Main" on a class
// named Solution.

class Solution
{
    static void Main(string[] args)
    {
        for (var i = 0; i < 5; i++)

jianminchen

const _ = require('lodash');

function sayHello() {
  console.log('Hello, World');
}

_.times(5, sayHello);

var canCross = function(stones) {
    let map = new Map();