## Finding the number that occurs odd number of times

Another puzzle that can be solved with eXclusive OR operator is to find the number that occurs odd number of

Another puzzle that can be solved with eXclusive OR operator is to find the number that occurs odd number of

To start with any new programming language and for understanding the language fundamentals we will try to execute some Hello

If the array elements are positive numbers and also elements are in the range 0 to n-1 , then we

Duplicates in the array can be found by general Brute force solution in the O(n^2) time. Can there be any

Finding duplicates in an array is a common interview question. The problem statement can be defined as follows. Given an

Towers of Hanoi is a mathematical puzzle, consists of three towers (rods or pegs) and number of disks of different

Reversing an array using Recursion is an example of Tail Recursion . We maintain two in-variants “i” and “j”. “i” holds

Linear Sum, sum of the “n” array elements can be computed easily by looping through the elements, this can be

Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers by definition, the first two numbers in the Fibonacci sequence are 1 and 1,

Power of a given number, x is a mathematical operation, written as x^n. involving two numbers, the base x and the exponent (or index or power)