string algorithms - C# practice

May 25, 2016

study string algorithms:
http://www.cnblogs.com/luxiaoxun/archive/2012/11/12/2766095.html

1. Find most frequent char in a string:
C# practice
https://gist.github.com/jianminchen/d530d47982262de8a5e1cf5b49f7b54a

2. Find a string can be a substring of another string's rotation:
Given s1 = "AABCD"  and s2 = "CDAA", return true; 
AABCD -> rotate to left -> BCDAA -> contains substring "CDAA"

Given s1 = "ABCD" and s2 = "ACBD", return false.

http://kenby.iteye.com/blog/1451910

http://www.cnblogs.com/kaituorensheng/archive/2013/06/01/3105042.html


BBC documentary: Amazon - Lead principles study:
https://www.youtube.com/watch?v=RXLAlziEzAE