ivycheung1208

/* CC150 1.1
 * Implement an algorithm to determine if a string has all unique characters.
 * What if you cannot use additional data structures? 
 */
 
#include <iostream>
#include <string>
#include <vector>

using namespace std;

ivycheung1208

/* CC150 1.2
 * Implement a function void reverse(char* str) in C or C++ which reverses a null-terminated string.
 */
 
#include <iostream>
#include <cstring>

using namespace std;

void reverse(char *str) { // c style index

ivycheung1208

/* CC150 1.3
 * Given two strings, write a method to decide if one is a permutation of the other. 
 */

#include <iostream>
#include <string>
#include <vector>

using namespace std;

ivycheung1208

/* CC150 1.4
 * Write a method to replace all spaces in a string with'%20'.
 * You may assume that the string has sufficient space at the end of the string to hold the additional characters,
 * and that you are given the "true" length of the string.
 */

#include <iostream>
#include <cstring>

using namespace std;

ivycheung1208

/* CC150 1.5
 * Implement a method to perform basic string compression using the counts of repeated characters.
 */

#include <iostream>
#include <string>

using namespace std;

string compress(string str)

ivycheung1208

/* CC150 1.6
 * Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes,
 * write a method to rotate the image by 90 degrees. Can you do this in place?
 */

#include <iostream>
#include <vector>

using namespace std;

ivycheung1208

/* CC150 1.7
 * Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.
 */

#include <iostream>
#include <vector>

using namespace std;

void setZeros(vector<vector<int>> &mat)

ivycheung1208

/* CC150 1.8
 * Assume you have a method isSubstring which checks if one word is a substring of another.
 * Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 using only one call to isSubstring
 * (e.g.,"waterbottle"is a rotation of"erbottlewat").
 */

#include <iostream>
#include <string>

using namespace std;

ivycheung1208

/* CC150 2.1
 * Write code to remove duplicates from an unsorted linked list.
 * How would you solve this problem if a temporary buffer is not allowed?
 */

#include <iostream>
#include <list>
#include <vector>

using namespace std;

ivycheung1208

/* CC150 2.2
 * Implement an algorithm to find the kth to last element of a singly linked list.
 */

#include <iostream>
#include <list>

using namespace std;

int kthToLast(list<int> lst, int k)