The Fibonacci sequence
This article looks at the interview question - Implement a function that returns the Fibonnaci number for a given integer input.
This article looks at the interview question - Implement a function that returns the Fibonnaci number for a given integer input.
Due to the issues of effectively source controlling the code on my blog using Blogger’s text editor and Google Drive, I’ve gone ahead and extracted most of the code samples into a GitHub project for your viewing and forking pleasure.
This article looks at the interview question - Implement a queue using two stacks.
This article looks at the interview question - Reverse a string in the most efficient way possible. For example an input of "abc123"
will result in the output "321cba"
.
This article looks at the interview question - Implement a function that performs integer division on two integers without the use of the division /
operator. For example for the input of 10
and 4
should result in the output of 2
.
Continue readingInteger division without the division operator (/)
This article looks at the interview question - Implement a function that gets all possible permutations (or orderings) of the characters in a string. For example for the input string "abc"
, the output will be "abc"
, "acb"
, "bac"
, "bca"
, "cab"
and "cba"
.
This article looks at the interview question - Implement a function that gets all possible combinations (or subsets) of the characters in a string with length of at least one. For example for the input string "abc"
, the output will be "a"
, "b"
, "c"
, "ab"
, "ac"
, "bc"
and "abc"
.