Algorithm · Confluent · Hard
Below are standard implementations for the three tasks. For Q1 I state the assumed input format, since the exact statement was not included. Q1 — Function signature matching Assumption: each signature is a string such as "max(int, int) -> int", and a call may be "max(3, 5) -> int" or just "max(3, 5)". Uppercase identifiers T, U, V, etc. are treated as generic type variables. The function returns the indices of all signatures that match the call. If the problem requires a…
Checking your access…