import java.util.ArrayList;

public class MainClass {

public static void main(String[] args) {

//SingleNumber2 sn2 = new SingleNumber2();

//sn2.test();

//ZigZag zz = new ZigZag();

//zz.testZigZag();

//zz.testLevelOrder();

//Candy candy = new Candy();

//candy.testCandy();

//ReverseInteger ri = new ReverseInteger();

//ri.testReverse();

//LevelOrderTraversal lot = new LevelOrderTraversal();

//lot.testLevelOrder();

//PreorderTraversal pt = new PreorderTraversal();

//pt.testPreorder();

//ReorderList rl = new ReorderList();

//rl.testReorder();

//StringToInteger sti = new StringToInteger();

//sti.testAtoI();

//ReversedPolishNotation rpn = new ReversedPolishNotation();

//rpn.testRPN();

//WordBreak wb = new WordBreak();

//wb.testWordBreak();

//InsertSort is = new InsertSort();

//is.testInsertion();

//SortList sl = new SortList();

//sl.testMerge();

//sl.testSortList();

//PascalTriangle2 pt2 = new PascalTriangle2();

//pt2.testTri();

//Triangle t = new Triangle();

//t.testMin();

//SortedListToBST s = new SortedListToBST();

//s.testRecur();

//MaxDepth md = new MaxDepth();

//md.testDepth();

//SumRootToLeaf s = new SumRootToLeaf();

//s.testSum();

//LongestConsecutiveSequence l = new LongestConsecutiveSequence();

//l.testCon();

//Stock2 s = new Stock2();

//s.testStock();

//Stock3 s = new Stock3();

//s.testStock();

//NextRight2 n = new NextRight2();

//n.testNext();

//PathSum ps = new PathSum();

//ps.testSum();

//PathSum2 ps = new PathSum2();

//ps.testSum();

//DistinctSubsequence ds = new DistinctSubsequence();

//ds.testNum();

//MinDepth md = new MinDepth();

//md.testDepth();

//BinaryTreeInorderPostOrder bt = new BinaryTreeInorderPostOrder();

//bt.testBuild();

//BinaryTreeInorderPreorder bt = new BinaryTreeInorderPreorder();

//bt.testBuild();

//SymmetricTree st = new SymmetricTree();

//st.testSymmetric();

//RecoverBST rb = new RecoverBST();

//rb.testRecover();

//UniqueBST ut = new UniqueBST();

//ut.testNum();

//ReverseLinkedList rl = new ReverseLinkedList();

//rl.testReverse();

//Subsets ss = new Subsets();

//ss.testSubsets();

//GrayCode gc = new GrayCode();

//gc.testGray();

//MergeSort ms = new MergeSort();

//ms.testMerge();

//PartitionList pl = new PartitionList();

//pl.testPartition();

//RemoveDuplicates rd = new RemoveDuplicates();

//rd.testDelete();

//RemoveDuplicates2 rd = new RemoveDuplicates2();

//rd.testDelete();

//SearchRotatedArray s = new SearchRotatedArray();

//s.testSearch();

//WordSearch ws = new WordSearch();

//ws.testExist();

//LongestSubWORepeat l = new LongestSubWORepeat();

//l.testLength();

//RemoveElement re = new RemoveElement();

//re.testRemove();

//RemoveDuplicatesFromSortedArray r = new RemoveDuplicatesFromSortedArray();

//r.testRemove();

//MergeTwoSortedLists m = new MergeTwoSortedLists();

//m.testMerge();

//SwapNodesInPair s = new SwapNodesInPair();

//s.testSwap();

//Permutations p = new Permutations();

//p.testPermute();

//SortColors s = new SortColors();

//s.testSort();

//RotateImage r = new RotateImage();

//r.test();

//GenerateParentheses g = new GenerateParentheses();

//g.test();

//LinkedListCycle2 l = new LinkedListCycle2();

//l.test();

//SpiralMatrix2 s = new SpiralMatrix2();

//s.test();

//RemoveDuplicatesFromSortedArray2 r = new RemoveDuplicatesFromSortedArray2();

//r.testRemove();

//PalindromeNumber p = new PalindromeNumber();

//p.test();

//TrappingRainWater t = new TrappingRainWater();

//t.test();

NQueens n = new NQueens();

n.test();

//NQueens2 n = new NQueens2();

//n.test();

//ThreeSumClosest t = new ThreeSumClosest();

//t.test();

//ValidSudoku v = new ValidSudoku();

//v.test();

//SearchForARange s = new SearchForARange();

//s.test();

//CountAndSay c = new CountAndSay();

//c.test();

//CombinationSum c = new CombinationSum();

//c.test();

//Power p = new Power();

//p.test();

//NextPermutation n = new NextPermutation();

//n.test();

//Permutations2 p = new Permutations2();

//p.test();

//PalindromePartitioning p = new PalindromePartitioning();

//p.test();

//EditDistance e = new EditDistance();

//e.test();

//ReverseNodesKGroup r = new ReverseNodesKGroup();

//r.test();

//GasStation g = new GasStation();

//g.test();

//CombinationSum2 c = new CombinationSum2();

//c.test();

//JumpGame2 j = new JumpGame2();

//j.test();

//MergeKSortedLists m = new MergeKSortedLists();

//m.test();

//Anagrams a = new Anagrams();

//a.test();

//FourSum f = new FourSum();

//f.test();

//Sqrt s = new Sqrt();

//s.test();

//PermutationSequence p = new PermutationSequence();

//p.test();

//ScrambleString s = new ScrambleString();

//s.test();

//CopyListRandomPointer c = new CopyListRandomPointer();

//c.test();

//LargestRectangleHistogram l = new LargestRectangleHistogram();

//l.test();

//LongestPalindromicSubstring l = new LongestPalindromicSubstring();

//l.test();

//MergeIntervals m = new MergeIntervals();

//m.test();

//InsertInterval i = new InsertInterval();

//i.test();

//SudokuSolver s = new SudokuSolver();

//s.test();

//RestoreIPAddress r = new RestoreIPAddress();

//r.test();

//MultiplyStrings m = new MultiplyStrings();

//m.test();

//RegularExpressionMatching r = new RegularExpressionMatching();

//r.test();

//BinaryTreeMaxSumPath m = new BinaryTreeMaxSumPath();

//m.test();

//SimplifyPath s = new SimplifyPath();

//s.test();

//InterleavingString i = new InterleavingString();

//i.test();

//LongestValidParentheses l = new LongestValidParentheses();

//l.test();

//PalindromePartitioning2 p = new PalindromePartitioning2();

//p.test();

//MinimumWindowSubstring m = new MinimumWindowSubstring();

//m.test();

//ThreeSum t = new ThreeSum();

//t.test();

//MainClass m = new MainClass();

//m.testHash();

//System.out.println(MainClass.parity("tesqqqqqqqqqqqqqr"));

//MainClass m = new MainClass();

//m.testN();

//MedianOfTwo m = new MedianOfTwo();

//m.test();

//DivideTwoIntegers d = new DivideTwoIntegers();

//d.test();

//DecodeWays d = new DecodeWays();

//d.test();

//WordBreak2 w = new WordBreak2();

//w.test();

//ValidNumber v = new ValidNumber();

//v.test();

WordLadder w = new WordLadder();

w.test();

//WordLadder2 w = new WordLadder2();

//w.test();

//MainClass.testString();

//SurroundedRegions s = new SurroundedRegions();

//s.test();

/*

LRUCache cache = new LRUCache(1);

cache.set(2,1);

cache.get(2);

cache.set(3,2);

cache.get(2);

cache.get(3);

*/

//TextJustification t = new TextJustification();

//t.test();

//WildcardMatching w = new WildcardMatching();

//w.test();

//MaxPointsOnALine m = new MaxPointsOnALine();

//m.test();

//SubstringWithConcatenationOfAllWords s = new SubstringWithConcatenationOfAllWords();

//s.test();

//ZigZagConversion z = new ZigZagConversion();

//z.test();

/*ReverseWordsInString r = new ReverseWordsInString();

r.test();*/

/*Combinations c = new Combinations();

c.test();*/

}

public static void testString() {

ArrayList<String> arr= new ArrayList<String>();

String s = "a";

arr.add(s);

System.out.println(arr.toString());

s = "b";

System.out.println(arr.toString());

}

public void testHash() {

String a = "Aa";

String b = "BBB";

int numa = 0;

int numb = 0;

for (int i = 0; i < a.length(); i++) {

System.out.println(a.charAt(i) + ": " + (int)a.charAt(i) + "; 31 ^ " + (a.length() - 1 - i));

numa += (int)a.charAt(i) * Math.pow(31, a.length() - 1 - i);

System.out.println(numa);

}

System.out.println("\n" + numa);

for (int i = 0; i < b.length(); i++) {

System.out.println(b.charAt(i) + ": " + (int)b.charAt(i) + "; 31 ^ " + (b.length() - 1 - i));

numb += (int)b.charAt(i) * Math.pow(31, b.length() - 1 - i);

System.out.println(numb);

}

System.out.println("\n" + numb);

int ans = 2147483647;

System.out.println(Integer.toBinaryString(ans));

System.out.println(Integer.MAX_VALUE);

String s = null;

s = "test";

System.out.println(s);

System.out.println("hashcode:");

System.out.println("a: " + a + "; code = " + a.hashCode());

System.out.println("b: " + b + "; code = " + b.hashCode());

}

public void testN() {

int n = 9999;

int two = 0;

int five = 0;

for (int i = 2; i <= n; i++) {

while (i % 2 == 0) {

two++;

i = i / 2;

}

while (i % 5 == 0) {

five++;

i = i / 5;

}

}

System.out.println(Math.min(two, five));

}

public static String parity(String s) {

String ans = null;

int n = s.hashCode();

switch (n % 2) {

case 0:

ans = "even";

break;

case 1:

ans = "odd";

break;

}

return ans;

}

public void testMain() {

ListNode head = new ListNode(3);

head.next = new ListNode(5);

head.next.next = new ListNode(7);

inner(head);

inner(head);

}

public void inner(ListNode p) {

System.out.println(p.val);

p = p.next;

}

}