brightlightkim

1.1. Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures? 1) Brute Force (I made this not to use additional data structure) Calculate each item by iterating the string >> result in O(n^2) boolean isUnique(String[] string){ for (int i = 0; i < string.length; i++){ //Since we compute one for i we don't have to start from i ag..

A problem Solving Flow Chart Listen Pay very close attention to any information in the problem description. You probably need it all for an optimal algorithm. Example Most examples are too small or are special cases. Debug your example. Is there any way it's a special case? Is it big enough? Brute Force get a brute-force solution as soon as possible. Don't worry about developing an efficient alg..

From Cracking the Coding Interview: Question 10: int sumDigits(int n) { int sum = 0; while (n < 0) { num += n % 10; n /= 10; } return sum; } The runtime will be the number of digits in the number. A number with d digits can have a value up to 10^d. if n = 10^d, then d = log n. Therefore, the runtime is 0(log n). Question 11: The following code prints all strings of length k where the characters ..