I joined the #100DaysOfAlgorithm Challenge.

##Logs

Day 0: January 20, 2017

1. generateParenthesis : Its is an algorithm for generating valid paranthesis strings for a given value n. Uses hashsets and List.

2. LRUCache : Its is an LRU implementation using HashMap and DeQueue or LinkedList with CacheNode(Created) Object.

Day 1: January 21, 2017

1. MaxXorInAnArray : Finding the XOR of 2 elements in an unempty array using HashMap and Bit manipulation.

2. MinStack: : Min Stack in O(n) space . ie without using an extra stack to store the min.

Day 2: January 22, 2017

1. Binary Tree Questions : 3 Binary Tree questions on LeetCode : Traversal, Rebuilding, ZIGZAG ordering, FlattenTreeInPlace

Day 3: January 24, 2017

1. Divide Integers : Integer Division without using MOD DIV or Mult in O(logn) time.

2. SurroundedRegions : Simple DFS Graph Questions to start of with DFS Implementations.

3. ConvertStringToInteger : Convert String to Integers(Requirements Interview Question)

Day 4: January 26, 2017

Day 5: January 27, 2017

Day 6: January 28, 2017

Day 7: January 29, 2017