Ishwarendra Jha

Hi @wingkwong I would like to work up on this issue. Problems: - https://leetcode.com/problems/fibonacci-number/description/ (in tutorial) - https://leetcode.com/problems/n-th-tribonacci-number/description/ (as suggested problem) - https://leetcode.com/problems/count-vowels-permutation/description/ (in tutorial) If problem other than leetcode...

If no one is working, I can take up this issue. I have following things in mind 1. How to find prime factors naively in $n \cdot log(n)$ time and...

- Expected Difficulty: easy

You should name your PR Title as multinomial Naive Bayes instead of csvreader.. Also, no merging of PR and new issue assignment will be done until next week.. Thanks.

Fix conflicts as well. @Modernbeast02

- Expected label: hard

Assigned @YashitaBansal

@NandiniGera Run formatter and commit again. "How to run formatter?" is already mentioned in [README.md](https://github.com/PEC-CSS/slowmokit/blob/main/README.md) point-9