jianminchen

'''
We have a collection of rocks, each rock has a positive integer weight.

Each turn, we choose any two rocks and smash them together.  Suppose the stones have weights x and y with x <= y.  The result of this smash is:

If x == y, both stones are totally destroyed;
If x != y, the stone of weight x is totally destroyed, and the stone of weight y has new weight y-x.
At the end, there is at most 1 stone left.  Return the smallest possible weight of this stone (the weight is 0 if there are no stones left.)

 

jianminchen

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

/*
 * To execute Java, please define "static void main" on a class
 * named Solution.
 *
 * If you need more classes, simply define them inline.
 
 algorithm:

jianminchen

'''
source = "good";
dest = "best";

var words = new string[] {"bood", "beod", "besd","goot","gost","gest","best"};

two paths
good->bood->beod->besd->best
good->goot->gost->gest->best

jianminchen

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace minimumDiff
{
    class Program
    {

jianminchen

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace unionFind
{
    class Program
    {

jianminchen

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace nthUglyNumber
{
    class Program
    {

jianminchen

count island 


2 3 4
2 2 4 4

number are same, same island 
the above matrix - how many islands we have

count shape - same shape 

jianminchen

def diff(w1, w2):
    delta = 0
    
    for i in range(len(w1)):
        x, y = w1[i], w2[i]
        if x != y:
            delta += 1

    return delta
        

jianminchen

def say_hello():
    print('Hello, World')

for i in range(5):
    say_hello()

'''
source = "good"; 
dest = "best";

jianminchen

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

class Solution {
  
  public List<List<String>> findAllPaths(String[] dict, String src, String dest){
    Set<String> set = new HashSet<>();
    for(String s:dict)
      set.add(s);