During the initial technical screening, we discussed DSA. Can you explain the approach to solve the classic "Frog Jump" Dynamic Programming (DP) problem to find the minimum cost to reach the final stone? Also, explain how you would handle potential collisions in a Hash Map (or Hash Table) and the trade-offs between different collision resolution techniques.
