Disjoint-set and Connected components Number of Connected Components in an Undirected G...
Disjoint-set and Connected components Number of Connected Components in an Undirected G...
https://leetcode.com/problems/minimum-knight-moves/ In an infinite chess board with coo...
DAY4 Questions: are there duplications in two lists?Thoughts: if no dup, build a binary...
DayThree Thoughts: window sliding, use two indexes(pointers) and slide over the string....
DAY TWO Simple method is to covert linked list into digits and then do the calculation,...
Day One Naive way is to use two for loop and scan the list and its time complexity is O...