refact: review

Author: hongbo-miao

JavaScript/1044. Longest Duplicate Substring.js

@@ -21,8 +21,8 @@
  */
 
 /** Binary Search + Rabin-Karp */
-// Time O(NlogN). O(logN) for the binary search and O(N) for Rabin-Karp algorithm.
-// Space O(N) to keep the hashset.
+// Time O(n log n). O(log n) for the binary search and O(N) for Rabin-Karp algorithm.
+// Space O(n) to keep the hashset.
 //
 // Split into two subtasks
 // Here we have "two in one" problem :

Python/0358. Rearrange String k Distance Apart.py

@@ -24,7 +24,6 @@
 """
 Priority queue
 """
-
 import heapq
 from collections import Counter
 

Python/0767. Reorganize String.py

@@ -44,6 +44,9 @@
 #
 # Since you dont have any values in the heap you check if the res string is == S, why ? (if your input is like 'aaa' then the heap approach will give you 'aaa' which is same as S)
 
+"""
+Priority queue
+"""
 import heapq
 from collections import Counter
 

Python/1167. Minimum Cost to Connect Sticks.py

@@ -22,7 +22,6 @@
 Priority queue
 """
 import heapq
-from collections import Counter
 
 
 class Solution: