If you are aiming for top companies, then coding is a must. This video series covers concept explanation as well as detailed live code for the most important programs asked in coding interviews.
A palindrome is a word, phrase, number or sequence of words that reads the same backwards as forwards. This lecture gives a detailed view on implementing palindrome program
Perfect number, a positive integer that is equal to the sum of its proper divisors. This lecture gives implementation of perfect number using c programming
A positive integer of n digits is called an Armstrong number of order n (order is number of digits) if abcd... = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n) + ....
Strong number is a special number whose sum of factorial of digits is equal to the original number. This lecture cover how to implement checking for strong number using c programming
This lecture covers four methods to implement swapping of numbers. The methods are using temp variable, call by reference - swap function, without temp variable and bit manipulation technique
A series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. This lecture is the simplest implementation of the fibonacci series without recursion