Cracking the Coding Interview: Difference between revisions
Jump to navigation
Jump to search
(Adding chapters and question 1.1...) |
(→Question 1.1: Formatting solution...) |
||
Line 9: | Line 9: | ||
Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures? | Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures? | ||
Solution: | Solution: [https://svn.jj5.net/jjrepo/cci/trunk/cci.01.01.js JavaScript] | ||
== Linked Lists == | == Linked Lists == |
Revision as of 15:04, 11 April 2014
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