In Bellman-Ford, after relaxing all edges V-1 times, how do we detect if a negative weight cycle is reachable from the source?
Shortest simple paths contain at most V-1 edges. If distances can still decrease on the V-th relaxation pass, a negative cycle exists.
What is the Edit Distance (Levenshtein Distance) between strings 'SUNDAY' and 'SATURDAY'?
'SUNDAY' can be transformed to 'SATURDAY' in 3 operations: insert 'A', insert 'T', and replace 'N' with 'R'.
In Subset Sum problem, given set $S = {3, 34, 4, 12, 5, 2}$ and target sum $T = 9, what$ is the boolean result?
Subset {4, 5} sums to 4 + 5 = 9. Subset {3, 4, 2} sums to 3 + 4 + 2 = 9. Thus, TRUE.
What is the minimum number of coins needed to make change for amount $V = 11 using coin denominations {1, 2, 5}$?
The optimal combination is 5 + 5 + 1 = 11, requiring 3 coins.
In Coin Change Number of Ways problem, how many ways can we make change for amount $V = 4 using coins {1, 2, 3}$?
Ways: (1,1,1,1), (1,1,2), (2,2), (1,3). Total 4 distinct ways.