Added Chinese remainder theorem#82

Open

Mayank9207 wants to merge 7 commits intoimsuraj675:mainfrom

Mayank9207:main

Contributor

Mayank9207 commented Jan 19, 2025

DESCRIPTION

Chinese remainder theorem statement and formulation
Time complexity is O(nlog(max modulus)) effectively
Space complexity is O(n)

CHECKLIST

Added readme file for explaining the theorem
Added the implementation in cpp,java and python
I have self-reviewed my codes
Updated the RoadMap.md file

Mayank9207 added 7 commits

January 16, 2025 18:08


          Create Chinese_remainder_theorem.cpp

1c70c27


          Create Chinese_remainder_theorem.java

64531ff


          Create Chinese_remainder_theorem.py

39926a4


          Create Chinese_remainder_theorem(README).md

6be105a


          Update Chinese_remainder_theorem(README).md

6663a54


          Update Chinese_remainder_theorem(README).md

bd70d06


          Update RoadMap.md

f758b47

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet