Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!. [#172]
Examples: Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero. Input: 5 Output: 1 Explanation: 5! = 120, one trailing zero.
Note: Your solution should be in logarithmic time complexity.
Largest Number
Given a list of non negative integers, arrange them such that they form the largest number. [#179]
Examples: Input: [10,2] Output: "210" Input: [3,30,34,5,9] Output: "9534330"
Note:
The result may be very large, so you need to return a string instead of an integer.
Repeated DNA Sequences
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for Example:
"ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA. [#187]
Write a function to find all the 10-letter-long sequences (substrings) that occur more than once in a DNA molecule.
Example:
Input: s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT" Output: ["AAAAACCCCC", "CCCCCAAAAA"]