From 9876a762728ac99afe363bf39e2f9767db30714c Mon Sep 17 00:00:00 2001 From: Yao Ding Date: Fri, 10 Aug 2018 12:56:28 -0400 Subject: [PATCH] Remove duplicate "count and say" question (#101) "Count and say" is at line 43 again --- algorithms/string.md | 1 - 1 file changed, 1 deletion(-) diff --git a/algorithms/string.md b/algorithms/string.md index 247aea05..1134886d 100644 --- a/algorithms/string.md +++ b/algorithms/string.md @@ -16,7 +16,6 @@ String - If you received a file in chunks, calculate when you have the full file. Quite an open-ended question. Can assume chunks come with start and end, or size, etc. - Given a list of names (strings) and the width of a line, design an algorithm to display them using the minimum number of lines. - Design a spell-checking algorithm. -- Count and say problem. - Longest substring with `K` unique characters. - [Source](http://blog.gainlo.co/index.php/2016/04/12/find-the-longest-substring-with-k-unique-characters/) - Given a set of random strings, write a function that returns a set that groups all the anagrams together.