Geeks for geeks practice question.
Problem statement: You are given an integer N. You have to find 4 integers i,j,k,l less than equal to N such that lcm(i,j,k,l) is maximum.
-
Notifications
You must be signed in to change notification settings - Fork 0
Geeks for geeks practice question.
A-geeky-man/A-Game-of-LCM
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Geeks for geeks practice question.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published