×
Home Discussions Write at Opengenus IQ
×
  • Track your progress
  • RANDOM
  • Join our Internship ๐ŸŽ“
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • #7daysOfCode
  • Linux ๐Ÿ’ฝ
  • ๐Ÿ”Š Data Structures
  • Graph Algorithms
  • Dynamic Programming ๐Ÿ’‘
  • Home
Shivani Rajput

Shivani Rajput

Student at School of Computer and Systems Sciences (SC&SS), Jawaharlal Nehru University (JNU), Delhi

New Delhi, India •
2 posts •
Algorithms

Algorithm to find the maximum power of N that divides M factorial (M!)

We are given two numbers M and N. Our aim is to find the highest power of N that divides Factorial of M (M!). First we have discussed about the Brute Force approach and then we will be discussing this problem using Legendreโ€™s formula.

Shivani Rajput Shivani Rajput
Software Engineering

Vector::front() in C++ STL

We have covered front() function of vector container in C++ STL in depth along with differences between front(), begin(), back() and end() Functions.

Shivani Rajput Shivani Rajput
OpenGenus IQ © 2022 All rights reserved โ„ข [email: team@opengenus.org]
Top Posts LinkedIn Twitter