Modular nCr using Fermat’s Little Theorem
Modular Arithmetic & Fast Power · 22:05Beginner Friendly Explanation · CodeMy notes
Sign in to keep private notes on every station, with video timestamps.
About this video
Video lecture "Modular nCr using Fermat’s Little Theorem" by codestorywithMIK, part of the Math chapter of the Data Structures & Algorithms course (22:05).
- Patterns
- Modular Arithmetic & Fast Power, Combinatorics & Counting
- Chapter
- Math
- Duration
- 22:05
Related problems
- Number of Ways to Reorder Array to Get Same BST (LeetCode 1569)
- Pow(x, n) (LeetCode 50)
- Count All Valid Pickup and Delivery Options (LeetCode 1359)
- Power of Four (LeetCode 342)
- Poor Pigs (LeetCode 458)
- Check if Number is a Sum of Powers of Three (LeetCode 1780)
- Find the Count of Good Integers (LeetCode 3272)
- Count the Number of Ideal Arrays (LeetCode 2338)