Cracking the Coding Interview: Difference between revisions
Jump to navigation
Jump to search
(→Question 1.1: Formatting solution...) |
(→Arrays and Strings: Question 1.2.) |
||
Line 10: | Line 10: | ||
Solution: [https://svn.jj5.net/jjrepo/cci/trunk/cci.01.01.js JavaScript] | Solution: [https://svn.jj5.net/jjrepo/cci/trunk/cci.01.01.js JavaScript] | ||
=== Question 1.2 === | |||
Write code to reverse a C-Style String. (C-String means that "abcd" is represented as five characters, including the null character.) | |||
Solution: [https://svn.jj5.net/jjrepo/cci/trunk/cci.01.02.js JavaScript] | |||
== Linked Lists == | == Linked Lists == |
Revision as of 14:36, 13 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
Question 1.2
Write code to reverse a C-Style String. (C-String means that "abcd" is represented as five characters, including the null character.)
Solution: JavaScript