We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 97d9ab2 commit 18467a0Copy full SHA for 18467a0
javascript/0187-repeated-dna-sequences.js
@@ -1,7 +1,8 @@
1
/**
2
* https://leetcode.com/problems/repeated-dna-sequences/
3
* Hashing
4
- * Time O(n) | Space O(n)
+ * s = the number of letters in the sequance. In our case it's 10. so the time complexity would be 10*n which boils down to n.
5
+ * Time O(s*n) | Space O(n)
6
* @param {string} s
7
* @return {string[]}
8
*/
0 commit comments