Hello everyone, this is my first time writing a blog. So pardon any mistakes. I am writing this because I genuinely curious if there is sub-linear approach to find factorials of a large number (1e9) under some modulo. Like any approach better than O(n)? Such as O(n/B), O(√n) or any less/more around them.
