package_20160820_1st_contest;

packagemedium;

importjava.io.PrintWriter;

importjava.util.ArrayList;

importjava.util.Collections;

importjava.util.Comparator;

importjava.util.Date;

importjava.util.List;

importjava.util.*;

importutils.CommonUtils;

package_20160820_1st_contest;

importjava.util.Stack;

packagemedium;

importutils.CommonUtils;

importjava.util.Stack;

publicclassLongestAbsoluteFilePath {

publicstaticintlengthLongestPath(Stringinput) {

Stack<Integer>stack =newStack();

| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes

|-----|----------------|---------------|---------------|---------------|-------------|--------------|-----

|415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../../blob/master/EASY/src/easy/AddStrings.java)| O(n)|O(1)| Easy|

|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)|[Solution](../../blob/master/MEDIUM/src/medium/LongestAbsoluteFilePath.java)| O(n)|O(d) | Medium| Stack

|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)|[Solution](../../blob/master/EASY/src/easy/FirstUniqueCharacterinaString.java)| O(n)|O(n) | Easy| HashMap

|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)|[Solution](../../blob/master/MEDIUM/src/medium/LexicographicalNumbers.java)| O(n)|O(1)| Medium|

|350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)|[Solution](../../blob/master/EASY/src/easy/IntersectionOfTwoArraysII.java)| O(m+n)|O((m+n)) could be optimized | Easy| HashMap, Binary Search

|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[Solution](../../blob/master/EASY/src/easy/IntersectionOfTwoArrays.java)| O(m+n)|O(min(m,n)) | Easy| Two Pointers, Binary Search

|325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)|[Solution] | O(n)|O(n) | Medium| HashMap