Complexity Analysis - Amazing Sum

DSA-solutions-the10xacademy / JavaScript-DSA-Solutions

1 stars 1 forks source link

Complexity Analysis - Amazing Sum #289

Open prathyusha10x opened 2 years ago

prathyusha10x commented 2 years ago

Please do not mark these check-boxes manually. They will be automatically marked when the respective sub-tasks are closed.

[ ] Stage 1 - Understand the problem
[ ] Stage 2 - New test cases
[ ] Stage 3 - Algorithm
[ ] Stage 4 - Implementation
[ ] Stage 5 - Dry run
[ ] Stage 6 - Test and submit

prathyusha10x commented 2 years ago

https://drive.google.com/drive/folders/1uZVnIDOuTnlsKGp2FHP6kT6PcA7bFJdK?usp=sharing

@shivateja1729 please review

shivateja1729 commented 2 years ago

@Abduliitr @prathyusha10x looks good, but its better to explain what is n in the problem description and how a for loop has O(n) time complexity, atleast for some videos.

prathyusha10x commented 2 years ago

@Abduliitr @shivateja1729 I have reopend this issue as this is not the final video. we are using this video for only february batch for future batches we will use the existing code for doing the complexity analysis solution videos.