1. Got Min deletions to make frequency of each letter unique
2. Given numbers 1-N and set of N edges,. find if it forms a cycle with ALL N nodes. Partial cycles should return false.

1ST one is same from the microsoft OA thread.
2nd one I built the adj list and traversed from 1 and counted how many nodes I have traversed from 1. When I end at 1 again i expect the total traversed node to be equal to 0