Cracking the Coding Interview

From John's wiki
Revision as of 15:04, 11 April 2014 by Sixsigma (talk | contribs) (→‎Question 1.1: Formatting solution...)
Jump to navigation Jump to search

Here are my answers to the questions from Cracking the Coding Interview, Fourth Edition.

Data Structures

Arrays and Strings

Question 1.1

Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures?

Solution: JavaScript

Linked Lists

Stacks and Queues

Trees and Graphs

Concepts and Algorithms

Bit Manipulation

Brain Teasers

Object Oriented Design

Recursion

Sorting and Searching

Mathematical

Testing

System Design and Memory Limits

Knowledge Based

C++

Java

Databases

Low Level

Networking

Threads and Locks

Additional Review Problems

Moderate

Hard

Retrieved from "https://www.jj5.net/wiki/mediawiki/index.php?title=Cracking_the_Coding_Interview&oldid=1934"