kolegaPanaLucjana

Prezent
Ulubiony
Wiadomość

Mężczyzna Paweł

widziany: 27.09.2025 10:26

119 plików
4,88 GB

Foldery

kolegaPanaLucjana

Audiobook

Harari Yuval Noah - 21 lekcji na XXI wiek

Kurs

Educative kursy

advanced system design interview prep crash course

build java projects with maven

decode the coding interview in java real world examples

developing microservic es with spring boot

domain driven design made easy

grokking coding interview patterns in java

	000-cour se overview
	001-who should take this course
	002-two pointers introduc tion
	003-vali d palindro me
	004-solu tion valid palindro me
	005-sum of three values
	006-solu tion sum of three values
	007-remo ve nth node from end of list
	008-solu tion remove nth node from end of list
	009-sort colors
	010-solu tion sort colors
	011-reve rse words in a string
	012-solu tion reverse words in a string
	013-vali d palindro me ii
	014-fast and slow pointers introduc tion
	015-happ y number
	016-solu tion happy number
	017-link ed list cycle
	018-solu tion linked list cycle
	019-midd le of the linked list
	020-solu tion middle of the linked list
	021-circ ular array loop
	022-solu tion circular array loop
	023-find the duplicat e number
	024-solu tion find the duplicat e number
	025-pali ndrome linked list
	026-solu tion palindro me linked list
	027-slid ing window introduc tion
	028-repe ated dna sequence s
	029-solu tion repeated dna sequence s
	030-find maximum in sliding window
	031-solu tion find maximum in sliding window
	032-mini mum window subseque nce
	033-solu tion minimum window subseque nce
	034-long est repeatin g characte r replacem ent
	035-solu tion longest repeatin g characte r replacem ent
	036-mini mum window substrin g
	037-solu tion minimum window substrin g
	038-long est substrin g without repeatin g characte rs
	039-solu tion longest substrin g without repeatin g characte rs
	040-mini mum size subarray sum
	041-solu tion minimum size subarray sum
	042-best time to buy and sell stock
	043-merg e interval s introduc tion
	044-merg e interval s
	045-solu tion merge interval s
	046-inse rt interval
	047-solu tion insert interval
	048-inte rval list intersec tions
	049-solu tion interval list intersec tions
	050-empl oyee free time
	051-solu tion employee free time
	052-task schedule r
	053-solu tion task schedule r
	054-meet ing rooms ii
	055-in place reversal of a linked list introduc tion
	056-reve rse linked list
	057-solu tion reverse linked list
	058-reve rse nodes in k group
	059-solu tion reverse nodes in k group
	060-reve rse linked list ii
	061-solu tion reverse linked list ii
	062-reor der list
	063-solu tion reorder list
	064-swap ping nodes in a linked list
	065-solu tion swapping nodes in a linked list
	066-reve rse nodes in even length groups
	067-solu tion reverse nodes in even length groups
	068-swap nodes in pairs
	069-two heaps introduc tion
	070-maxi mize capital
	071-solu tion maximize capital
	072-find median from a data stream
	073-solu tion find median from a data stream
	074-slid ing window median
	075-solu tion sliding window median
	076-sche dule tasks on minimum machines
	077-solu tion schedule tasks on minimum machines
	078-k way merge introduc tion
	079-merg e sorted array
	080-solu tion merge sorted array
	081-kth smallest number in m sorted lists
	082-solu tion kth smallest number in m sorted lists
	083-find k pairs with smallest sums
	084-solu tion find k pairs with smallest sums
	085-merg e k sorted lists
	086-solu tion merge k sorted lists
	087-kth smallest element in a sorted matrix
	088-solu tion kth smallest element in a sorted matrix
	089-top k elements introduc tion
	090-kth largest element in a stream
	091-solu tion kth largest element in a stream
	092-reor ganize string
	093-solu tion reorgani ze string
	094-k closest points to origin
	095-solu tion k closest points to origin
	096-top k frequent elements
	097-solu tion top k frequent elements
	098-kth largest element in an array
	099-solu tion kth largest element in an array
	100-top k frequent words
	101-modi fied binary search introduc tion
	102-bina ry search
	103-solu tion binary search
	104-sear ch in rotated sorted array
	105-solu tion search in rotated sorted array
	106-firs t bad version
	107-solu tion first bad version
	108-rand om pick with weight
	109-solu tion random pick with weight
	110-find k closest elements
	111-solu tion find k closest elements
	112-sing le element in a sorted array
	113-solu tion single element in a sorted array
	114-sear ch in rotated sorted array ii
	115-subs ets introduc tion
	116-subs ets
	117-solu tion subsets
	118-perm utations
	119-solu tion permutat ions
	120-lett er combinat ions of a phone number
	121-solu tion letter combinat ions of a phone number
	122-gene rate parenthe ses
	123-solu tion generate parenthe ses
	124-find k sum subsets
	125-gree dy techniqu es introduc tion
	126-jump game i
	127-solu tion jump game i
	128-boat s to save people
	129-solu tion boats to save people
	130-gas stations
	131-solu tion gas stations
	132-two city scheduli ng
	133-solu tion two city scheduli ng
	134-mini mum number of refuelin g stops
	135-solu tion minimum number of refuelin g stops
	136-jump game ii
	137-back tracking introduc tion
	138-n queens
	139-solu tion n queens
	140-word search
	141-solu tion word search
	142-hous e robber iii
	143-solu tion house robber iii
	144-rest ore ip addresse s
	145-solu tion restore ip addresse s
	146-floo d fill
	147-solu tion flood fill
	148-sudo ku solver
	149-matc hsticks to square
	150-dyna mic programm ing introduc tion
	151-0 1 knapsack
	152-solu tion 0 1 knapsack
	153-coin change
	154-solu tion coin change
	155-n th tribonac ci number
	156-solu tion n th tribonac ci number
	157-part ition equal subset sum
	158-solu tion partitio n equal subset sum
	159-coun ting bits
	160-solu tion counting bits
	161-01 matrix
	162-solu tion 01 matrix
	163-hous e robber ii
	164-solu tion house robber ii
	165-maxi mum product subarray
	166-solu tion maximum product subarray
	167-comb ination sum
	168-solu tion combinat ion sum
	169-word break
	170-solu tion word break
	171-pali ndromic substrin gs
	172-solu tion palindro mic substrin gs
	173-long est common subseque nce
	174-solu tion longest common subseque nce
	175-word break ii
	176-solu tion word break ii
	177-deco de ways
	178-solu tion decode ways
	179-clim bing stairs
	180-cycl ic sort introduc tion
	181-miss ing number
	182-solu tion missing number
	183-firs t missing positive
	184-solu tion first missing positive
	185-find the corrupt pair
	186-solu tion find the corrupt pair
	187-find the first k missing positive numbers
	188-topo logical sort introduc tion
	189-comp ilation order
	190-solu tion compilat ion order
	191-alie n dictiona ry
	192-solu tion alien dictiona ry
	193-veri fying an alien dictiona ry
	194-solu tion verifyin g an alien dictiona ry
	195-cour se schedule ii
	196-solu tion course schedule ii
	197-cour se schedule
	198-solu tion course schedule
	199-find all possible recipes from given supplies
	200-matr ices introduc tion
	201-set matrix zeros
	202-solu tion set matrix zeros
	203-rota te image
	204-solu tion rotate image
	205-spir al matrix
	206-solu tion spiral matrix
	207-wher e will the ball fall
	208-solu tion where will the ball fall
	209-stac ks introduc tion
	210-basi c calculat or
	211-solu tion basic calculat or
	212-remo ve all adjacent duplicat es in string
	213-solu tion remove all adjacent duplicat es in string
	214-mini mum remove to make valid parenthe ses
	215-solu tion minimum remove to make valid parenthe ses
	216-excl usive executio n time of function s
	217-solu tion exclusiv e executio n time of function s
	218-flat ten nested list iterator
	219-solu tion flatten nested list iterator
	220-impl ement queue using stacks
	221-solu tion implemen t queue using stacks
	222-vali d parenthe ses
	223-grap hs introduc tion
	224-netw ork delay time
	225-solu tion network delay time
	226-path s in maze that lead to same room
	227-solu tion paths in maze that lead to same room
	228-clon e graph
	229-solu tion clone graph
	230-grap h valid tree
	231-solu tion graph valid tree
	232-bus routes
	233-solu tion bus routes
	234-tree depth first search introduc tion
	235-flat ten binary tree to linked list
	236-solu tion flatten binary tree to linked list
	237-diam eter of binary tree
	238-solu tion diameter of binary tree
	239-seri alize and deserial ize binary tree
	240-solu tion serializ e and deserial ize binary tree
	241-inve rt binary tree
	242-solu tion invert binary tree
	243-bina ry tree maximum path sum
	244-solu tion binary tree maximum path sum
	245-conv ert sorted array to binary search tree
	246-solu tion convert sorted array to binary search tree
	247-buil d binary tree from preorder and inorder traversa l
	248-solu tion build binary tree from preorder and inorder traversa l
	249-bina ry tree right side view
	250-solu tion binary tree right side view
	251-lowe st common ancestor in a binary tree
	252-solu tion lowest common ancestor in a binary tree
	253-vali date binary search tree
	254-solu tion validate binary search tree
	255-maxi mum depth of binary tree
	256-kth smallest element in a bst
	257-tree breadth first search introduc tion
	258-leve l order traversa l of binary tree
	259-solu tion level order traversa l of binary tree
	260-bina ry tree zigzag level order traversa l
	261-solu tion binary tree zigzag level order traversa l
	262-popu lating next right pointers in each node
	263-solu tion populati ng next right pointers in each node
	264-vert ical order traversa l of a binary tree
	265-solu tion vertical order traversa l of a binary tree
	266-symm etric tree
	267-solu tion symmetri c tree
	268-word ladder
	269-solu tion word ladder
	270-conn ect all siblings of a binary tree
	271-trie introduc tion
	272-impl ement trie
	273-solu tion implemen t trie
	274-sear ch suggesti ons system
	275-solu tion search suggesti ons system
	276-repl ace words
	277-solu tion replace words
	278-desi gn add and search words data structur e
	279-solu tion design add and search words data structur e
	280-word search ii
	281-solu tion word search ii
	282-lexi cographi cal numbers
	283-hash maps introduc tion
	284-desi gn hashmap
	285-solu tion design hashmap
	286-frac tion to recurrin g decimal
	287-solu tion fraction to recurrin g decimal
	288-logg er rate limiter
	289-solu tion logger rate limiter
	290-next greater element
	291-solu tion next greater element
	292-isom orphic strings
	293-solu tion isomorph ic strings
	294-long est palindro me
	295-know ing what to track introduc tion
	296-pali ndrome permutat ion
	297-solu tion palindro me permutat ion
	298-vali d anagram
	299-solu tion valid anagram
	300-desi gn tic tac toe
	301-solu tion design tic tac toe
	302-grou p anagrams
	303-solu tion group anagrams
	304-maxi mum frequenc y stack
	305-solu tion maximum frequenc y stack
	306-firs t unique characte r in a string
	307-solu tion first unique characte r in a string
	308-find all anagrams in a string
	309-solu tion find all anagrams in a string
	310-long est palindro me by concaten ating two letter words
	311-solu tion longest palindro me by concaten ating two letter words
	312-rans om note
	313-unio n find introduc tion
	314-redu ndant connecti on
	315-solu tion redundan t connecti on
	316-numb er of islands
	317-solu tion number of islands
	318-most stones removed with same row or column
	319-solu tion most stones removed with same row or column
	320-long est consecut ive sequence
	321-solu tion longest consecut ive sequence
	322-last day where you can still cross
	323-solu tion last day where you can still cross
	324-regi ons cut by slashes
	325-solu tion regions cut by slashes
	326-acco unts merge
	327-solu tion accounts merge
	328-mini mize malware spread
	329-solu tion minimize malware spread
	330-eval uate division
	331-cust om data structur es introduc tion
	332-snap shot array
	333-solu tion snapshot array
	334-time based key value store
	335-solu tion time based key value store
	336-impl ement lru cache
	337-solu tion implemen t lru cache
	338-inse rt delete getrando m o 1
	339-solu tion insert delete getrando m o 1
	340-min stack
	341-solu tion min stack
	342-lfu cache
	343-bitw ise manipula tion introduc tion
	344-find the differen ce
	345-solu tion find the differen ce
	346-comp lement of base 10 number
	347-solu tion compleme nt of base 10 number
	348-flip ping an image
	349-solu tion flipping an image
	350-sing le number
	351-solu tion single number
	352-two single numbers
	353-solu tion two single numbers
	354-enco de and decode strings
	355-solu tion encode and decode strings
	356-reve rse bits
	357-chal lenge yourself introduc tion
	358-shor test bridge
	359-numb er of connecte d componen ts in an undirect ed graph
	360-medi an of two sorted arrays
	361-paci fic atlantic water flow
	362-cont ains duplicat e
	363-maxi mum subarray
	364-two sum
	365-find minimum in rotated sorted array
	366-non overlapp ing interval s
	367-meet ing rooms
	368-larg est rectangl e in histogra m
	369-subt ree of another tree
	370-sort list
	371-numb er of 1 bits
	372-cont ainer with the most water
	373-eval uate reverse polish notation
	374-4sum
	375-loud and rich
	376-prod uct of array except self
	377-long est increasi ng subseque nce
	378-sum of two integers
	379-majo rity element
	380-uniq ue paths
	381-long est palindro mic substrin g
	382-perm utations ii
	383-numb er of province s
	384-link ed list cycle ii
	385-mini mum flips to make the binary string alternat e
	386-lemo nade change
	387-hous e robber
	388-find all numbers disappea red in an array
	389-find all duplicat es in an array
	390-same tree
	391-desi gn in memory file system
	392-desi gn file system
	393-aste roid collisio n
	394-rott ing oranges
	395-add binary
	396-mult iply strings
	397-wher e to go from here

grokking dynamic programming a deep dive using java

grokking the api design interview

grokking the behavioral interview

grokking the principles and practices of advanced system design

hexagonal software architectur e for web application s

java multithread ing for senior engineering interviews

software architectur e in java design development

system design interview prep crash course

system-desi gn

the complete guide to spring 5 and spring boot 2

the java interview handbook 300plus interview questions

the system design interview prep handbook

pdf

Program

zachomikowane

Ostatnio pobierane pliki

Docker Desktop Installer.exe

Teams_windows_x64.exe

Splashtop_Wired_XDisplay_Agent_v1.5.8.3.exe

Visual Studio 2012.exe

English-Speaking.pdf

Git-2.31.1-64-bit.exe

Oxford - Technology 2 - Teacher's book.PDF

KeePass-2.53-Setup.exe

Język C++ - Bjarne Stroustrup.pdf

Eugeniusz Wróbel - Programowanie w Języku Asemblera MASM.pdf

grokking coding interview patterns in java

Galeria

000-course overview	001-who should take this course	002-two pointers introduction
003-valid palindrome	004-solution valid palindrome	005-sum of three values
006-solution sum of three values	007-remove nth node from end of list	008-solution remove nth node from end of list
009-sort colors	010-solution sort colors	011-reverse words in a string
012-solution reverse words in a string	013-valid palindrome ii	014-fast and slow pointers introduction
015-happy number	016-solution happy number	017-linked list cycle
018-solution linked list cycle	019-middle of the linked list	020-solution middle of the linked list
021-circular array loop	022-solution circular array loop	023-find the duplicate number
024-solution find the duplicate number	025-palindrome linked list	026-solution palindrome linked list
027-sliding window introduction	028-repeated dna sequences	029-solution repeated dna sequences
030-find maximum in sliding window	031-solution find maximum in sliding window	032-minimum window subsequence
033-solution minimum window subsequence	034-longest repeating character replacement	035-solution longest repeating character replacement
036-minimum window substring	037-solution minimum window substring	038-longest substring without repeating characters
039-solution longest substring without repeating characters	040-minimum size subarray sum	041-solution minimum size subarray sum
042-best time to buy and sell stock	043-merge intervals introduction	044-merge intervals
045-solution merge intervals	046-insert interval	047-solution insert interval
048-interval list intersections	049-solution interval list intersections	050-employee free time
051-solution employee free time	052-task scheduler	053-solution task scheduler
054-meeting rooms ii	055-in place reversal of a linked list introduction	056-reverse linked list
057-solution reverse linked list	058-reverse nodes in k group	059-solution reverse nodes in k group
060-reverse linked list ii	061-solution reverse linked list ii	062-reorder list
063-solution reorder list	064-swapping nodes in a linked list	065-solution swapping nodes in a linked list
066-reverse nodes in even length groups	067-solution reverse nodes in even length groups	068-swap nodes in pairs
069-two heaps introduction	070-maximize capital	071-solution maximize capital
072-find median from a data stream	073-solution find median from a data stream	074-sliding window median
075-solution sliding window median	076-schedule tasks on minimum machines	077-solution schedule tasks on minimum machines
078-k way merge introduction	079-merge sorted array	080-solution merge sorted array
081-kth smallest number in m sorted lists	082-solution kth smallest number in m sorted lists	083-find k pairs with smallest sums
084-solution find k pairs with smallest sums	085-merge k sorted lists	086-solution merge k sorted lists
087-kth smallest element in a sorted matrix	088-solution kth smallest element in a sorted matrix	089-top k elements introduction
090-kth largest element in a stream	091-solution kth largest element in a stream	092-reorganize string
093-solution reorganize string	094-k closest points to origin	095-solution k closest points to origin
096-top k frequent elements	097-solution top k frequent elements	098-kth largest element in an array
099-solution kth largest element in an array	100-top k frequent words	101-modified binary search introduction
102-binary search	103-solution binary search	104-search in rotated sorted array
105-solution search in rotated sorted array	106-first bad version	107-solution first bad version
108-random pick with weight	109-solution random pick with weight	110-find k closest elements
111-solution find k closest elements	112-single element in a sorted array	113-solution single element in a sorted array
114-search in rotated sorted array ii	115-subsets introduction	116-subsets
117-solution subsets	118-permutations	119-solution permutations
120-letter combinations of a phone number	121-solution letter combinations of a phone number	122-generate parentheses
123-solution generate parentheses	124-find k sum subsets	125-greedy techniques introduction
126-jump game i	127-solution jump game i	128-boats to save people
129-solution boats to save people	130-gas stations	131-solution gas stations
132-two city scheduling	133-solution two city scheduling	134-minimum number of refueling stops
135-solution minimum number of refueling stops	136-jump game ii	137-backtracking introduction
138-n queens	139-solution n queens	140-word search
141-solution word search	142-house robber iii	143-solution house robber iii
144-restore ip addresses	145-solution restore ip addresses	146-flood fill
147-solution flood fill	148-sudoku solver	149-matchsticks to square
150-dynamic programming introduction	151-0 1 knapsack	152-solution 0 1 knapsack
153-coin change	154-solution coin change	155-n th tribonacci number
156-solution n th tribonacci number	157-partition equal subset sum	158-solution partition equal subset sum
159-counting bits	160-solution counting bits	161-01 matrix
162-solution 01 matrix	163-house robber ii	164-solution house robber ii
165-maximum product subarray	166-solution maximum product subarray	167-combination sum
168-solution combination sum	169-word break	170-solution word break
171-palindromic substrings	172-solution palindromic substrings	173-longest common subsequence
174-solution longest common subsequence	175-word break ii	176-solution word break ii
177-decode ways	178-solution decode ways	179-climbing stairs
180-cyclic sort introduction	181-missing number	182-solution missing number
183-first missing positive	184-solution first missing positive	185-find the corrupt pair
186-solution find the corrupt pair	187-find the first k missing positive numbers	188-topological sort introduction
189-compilation order	190-solution compilation order	191-alien dictionary
192-solution alien dictionary	193-verifying an alien dictionary	194-solution verifying an alien dictionary
195-course schedule ii	196-solution course schedule ii	197-course schedule
198-solution course schedule	199-find all possible recipes from given supplies	200-matrices introduction
201-set matrix zeros	202-solution set matrix zeros	203-rotate image
204-solution rotate image	205-spiral matrix	206-solution spiral matrix
207-where will the ball fall	208-solution where will the ball fall	209-stacks introduction
210-basic calculator	211-solution basic calculator	212-remove all adjacent duplicates in string
213-solution remove all adjacent duplicates in string	214-minimum remove to make valid parentheses	215-solution minimum remove to make valid parentheses
216-exclusive execution time of functions	217-solution exclusive execution time of functions	218-flatten nested list iterator
219-solution flatten nested list iterator	220-implement queue using stacks	221-solution implement queue using stacks
222-valid parentheses	223-graphs introduction	224-network delay time
225-solution network delay time	226-paths in maze that lead to same room	227-solution paths in maze that lead to same room
228-clone graph	229-solution clone graph	230-graph valid tree
231-solution graph valid tree	232-bus routes	233-solution bus routes
234-tree depth first search introduction	235-flatten binary tree to linked list	236-solution flatten binary tree to linked list
237-diameter of binary tree	238-solution diameter of binary tree	239-serialize and deserialize binary tree
240-solution serialize and deserialize binary tree	241-invert binary tree	242-solution invert binary tree
243-binary tree maximum path sum	244-solution binary tree maximum path sum	245-convert sorted array to binary search tree
246-solution convert sorted array to binary search tree	247-build binary tree from preorder and inorder traversal	248-solution build binary tree from preorder and inorder traversal
249-binary tree right side view	250-solution binary tree right side view	251-lowest common ancestor in a binary tree
252-solution lowest common ancestor in a binary tree	253-validate binary search tree	254-solution validate binary search tree
255-maximum depth of binary tree	256-kth smallest element in a bst	257-tree breadth first search introduction
258-level order traversal of binary tree	259-solution level order traversal of binary tree	260-binary tree zigzag level order traversal
261-solution binary tree zigzag level order traversal	262-populating next right pointers in each node	263-solution populating next right pointers in each node
264-vertical order traversal of a binary tree	265-solution vertical order traversal of a binary tree	266-symmetric tree
267-solution symmetric tree	268-word ladder	269-solution word ladder
270-connect all siblings of a binary tree	271-trie introduction	272-implement trie
273-solution implement trie	274-search suggestions system	275-solution search suggestions system
276-replace words	277-solution replace words	278-design add and search words data structure
279-solution design add and search words data structure	280-word search ii	281-solution word search ii
282-lexicographical numbers	283-hash maps introduction	284-design hashmap
285-solution design hashmap	286-fraction to recurring decimal	287-solution fraction to recurring decimal
288-logger rate limiter	289-solution logger rate limiter	290-next greater element
291-solution next greater element	292-isomorphic strings	293-solution isomorphic strings
294-longest palindrome	295-knowing what to track introduction	296-palindrome permutation
297-solution palindrome permutation	298-valid anagram	299-solution valid anagram
300-design tic tac toe	301-solution design tic tac toe	302-group anagrams
303-solution group anagrams	304-maximum frequency stack	305-solution maximum frequency stack
306-first unique character in a string	307-solution first unique character in a string	308-find all anagrams in a string
309-solution find all anagrams in a string	310-longest palindrome by concatenating two letter words	311-solution longest palindrome by concatenating two letter words
312-ransom note	313-union find introduction	314-redundant connection
315-solution redundant connection	316-number of islands	317-solution number of islands
318-most stones removed with same row or column	319-solution most stones removed with same row or column	320-longest consecutive sequence
321-solution longest consecutive sequence	322-last day where you can still cross	323-solution last day where you can still cross
324-regions cut by slashes	325-solution regions cut by slashes	326-accounts merge
327-solution accounts merge	328-minimize malware spread	329-solution minimize malware spread
330-evaluate division	331-custom data structures introduction	332-snapshot array
333-solution snapshot array	334-time based key value store	335-solution time based key value store
336-implement lru cache	337-solution implement lru cache	338-insert delete getrandom o 1
339-solution insert delete getrandom o 1	340-min stack	341-solution min stack
342-lfu cache	343-bitwise manipulation introduction	344-find the difference
345-solution find the difference	346-complement of base 10 number	347-solution complement of base 10 number
348-flipping an image	349-solution flipping an image	350-single number
351-solution single number	352-two single numbers	353-solution two single numbers
354-encode and decode strings	355-solution encode and decode strings	356-reverse bits
357-challenge yourself introduction	358-shortest bridge	359-number of connected components in an undirected graph
360-median of two sorted arrays	361-pacific atlantic water flow	362-contains duplicate
363-maximum subarray	364-two sum	365-find minimum in rotated sorted array
366-non overlapping intervals	367-meeting rooms	368-largest rectangle in histogram
369-subtree of another tree	370-sort list	371-number of 1 bits
372-container with the most water	373-evaluate reverse polish notation	374-4sum
375-loud and rich	376-product of array except self	377-longest increasing subsequence
378-sum of two integers	379-majority element	380-unique paths
381-longest palindromic substring	382-permutations ii	383-number of provinces
384-linked list cycle ii	385-minimum flips to make the binary string alternate	386-lemonade change
387-house robber	388-find all numbers disappeared in an array	389-find all duplicates in an array
390-same tree	391-design in memory file system	392-design file system
393-asteroid collision	394-rotting oranges	395-add binary
396-multiply strings	397-where to go from here