I’m just wondering - are there plans to introduce additional test cases for the questions that don’t have many? For example, Subarray Sum - Fixed (Subarray Sum - Fixed) has just one test case, and it’s the same as the example given in the problem description. I have written solutions that were incorrect but passed all test cases on AlgoMonster. I had to run them on LeetCode to find that there are cases where they didn’t work correctly. Since AlgoMonster is supposed to be an all in one place to learn and practice for coding interviews, it would be really helpful if there were exhaustive test case sets for each problem.
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| What actually are ad hoc problems? | 0 | 38 | June 8, 2024 | |
| Top Patterns to Conquer the Interview - Getting Started / Overview | 38 | 6447 | August 2, 2024 | |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit - Miscellaneous / Monotonic Stack | 1 | 207 | November 15, 2022 | |
| Improvements to Evaluator | 1 | 25 | October 13, 2024 | |
| Word Search - Backtracking / Additional Practices | 2 | 183 | November 24, 2021 |