PrepBytes Interview Preparation Marathon - Searching+ Sorting | Aman and Shopping | PrepShopping

Interview Preparation Marathon - Recursion
Problem Name : Mike and Binary Number
Problem ID: BINARYNUM

Pre-requisite - Sorting , Logic Building

[tejaswigutta]

This can even be done without using frequency array by just checking if current element==next element then we don't consider it and for last element of array we consider it without checking above condition.

This saves space of frequency array

[bhavyavijay]

Can you plz elaborate the working of freq[arr[i]]==0??
how will this work ??