Algorithm: All Possible Increasing Subsequences

March 18, 2017

Introduction

Julia usually does some study after each Hacerrank contest, she mainly looked up the players and see what others are sharing. She will come back to review the blog, and this blog has 23 blogs on algorithm problems.

She likes to invest 20 - 30 minutes on one of algorithms and see how it goes. The time is from March 18, 2017, 1:47pm - 2:10pm. The algorithm is called All Possible Increasing Subsequences.

Read binary index tree wiki article.
Read hackearth binary index tree tutorial. (9:01pm - 9:20pm learn something here!)
Read geekforgeeks Count All increasing subsequences (9:30pm - 9:50pm)

Study one algorithm a time 

1. March 18, 2017, 1:47pm - 2:10pm. (could not focus, move on another algorithm)
2. March 18, 2017, 7:31pm - 8:00pm (mental workout, and try to learn binary index tree)
3. March 18, 2017, 8:00pm - 8:30pm

Summary of study

Not fully understand the algorithm. Move on! Just learn the binary index tree.