1000

This lecture covers basic concept of checking for even and odd number also line by line code for the program

Prime number program is very important for most programming interviews, this lecture covers the method to identify prime numbers with detailed code

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) + ....

Through this lecture you will learn to calculate the factorial of a number using for loop

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 the concept and code for implementation of counting digits of the given number

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

This may sound tricky but it actually its a very implementation. Learn it through this lecture.

Finding largest with conditional statement is easy, but without conditional is a tricky one, Learn it now.

This lecture covers concept of finding area of a triangle with the use of math function sqrt

This lecture covers the concept of finding volume of sphere and code implementation with c programming