Big-O
Reply
Category Archives: Programming
CTCI: Ch. 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 (i.e., “waterbottle” is a rotation of “erbottlewat”).
CTCI: Ch. 1-5
Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2b1c5a3. If the “compressed” string would not become smaller than the original string, your method should return the original string.
CTCI: Ch. 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. (Note: if implementing in Java, please use a character array so that you can perform this operation in place.)
EXAMPLE
Input: “Mr John Smith ”
Output: “Mr%20John%20Smith”
CTCI: Ch. 1-3
Given two strings, write a method to decide if one is a permutation of the other.
Android Remote Control for net-TV3
This app uses wireless network to connect your PC and then sends commands to control your player software. Now, it only supports UPMOST net-TV3 (network TV-BOX).
Development tool:
- Server: Embarcadero C++ Builder XE3
- Client: Eclipse with Android SDK
- Testing Platform: HTC Desire HD (Android 2.3.4)
Use UltraEdit to compile Objective-C
For Windows users, you need to install GNUstep Core and MSYS System.
Command example: gcc -o hello hello.m -fconstant-string-class=NSConstantString -I C:/GNUstep/GNUstep/System/Library/Headers/ -L C:/GNUstep/GNUstep/System/Library/Libraries/ -lobjc -lgnustep-base
CTCI: Ch. 1-2
Implement a function void reverse(char* str) in C or C++ which reverses a null-terminated string.
CTCI: Ch. 1-1
Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
Chapter 2. Linked Lists
-
Write code to remove duplicates from an unsorted linked list.
FOLLOW UP
How would you solve this problem if a temporary buffer is not allowed? - Implement an algorithm to find the nth to last element of a singly linked list.
-
Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node.
EXAMPLE
Input: the node c from the linked list a->b->c->d->e
Result: nothing is returned, but the new linked list looks like a->b->d->e