This course will become read-only in the near future. Tell us at community.p2pu.org if that is a problem.
This place is specifically for the people who would want to improve their programming skills. It not just about the solution of a problem but more in terms of minimizing space, complexity and LOCs(Line of Code).
Prior Programming experience is required. But yes you can learn by following and later doing.
Check If two string are anagrammatic, this means, the if you can get the second string by rearrenge the Characters of one string.
For Example:
1) georgebush
2) hebugsgore
Now, implementing this would be way to simple, lets add a complexity here,
You need to do it in less then O(nlogn) time.
If you use any sort function, the complexity would be nlogn, hence not an acceptable solution.
