codewars是一个很棒的刷算法题的网站，目前有C，C++，JAVA，Python等36种语言可供练习。我大致看了一下，难度由浅到深的分级（1-8级）还是很不错的。我会从稍简单的C++6级题开始讲解（8级有点太简单，一两行代码的题就免了吧）,随后会跟着网站推荐的节奏升级。每期视频讲解一道题，大约15-30分钟左右。另外项目系列也在做，只不过更新频率会比较慢，因为要准备的东西很多。
闲话就这么多，看下今天的题目及视频讲解：
Given two arrays of strings a1 and a2 return a sorted array r in lexicographical order of the strings of a1 which are substrings of strings of a2.
#Example1: a1= ["arp","live","strong"]
a2= ["lively","alive","harp","sharp","armstrong"]
returns ["arp","live","strong"]
#Example2: a1= ["tarp","mice","bull"]
a2= ["lively","alive","harp","sharp","armstrong"]
returns []
视频讲解可在微信公众号观看，或在腾讯视频/b站搜索：在codewars里升级吧~1
来源微信公众号：小霍编程