Andrii Siriak
Andrii Siriak
No, coding problems just ask you to find which approach to use (dynamic programming, graph algorithms, etc.) and implement it. The approach is the same in many problems, just wrapper...
Is this a well-known algorithm? We only add those
Please fix PR checks
Please fix infer PR check
It says src/main/java/com/thealgorithms/scheduling/LotteryScheduling.java:56: error: Null Dereference(NULLPTR_DEREFERENCE) `selectedProcess` could be null (from the call to `LotteryScheduling.selectProcessByTicket(...)` on line 54) and is dereferenced. 54. Process selectedProcess = selectProcessByTicket(winningTicket); 55. 56. > selectedProcess.setWaitingTime(currentTime);...
@alxkm please review
Please fix PR checks
Please fix tests, they never stop
I think it's already implemented here https://github.com/TheAlgorithms/Java/blob/4a03f420616a6773e9a5cdc304b1681e96d945bd/src/main/java/com/thealgorithms/dynamicprogramming/LevenshteinDistance.java#L11. Isn't it the same?
Ok, then please add Damerau-Levenshtein distance and we'll review it