Coding interviews can be stressful. Preparation is key, this section focuses on how to prepare rightly and eventually get hired.

Prime number is a very important topic as far as the technical Interviews are concerned. A prime number is a whole number greater than 1 whose only factors are 1 and itself. Based on this logic we wil ...

read moreA number is said to be Palindrome number if it remains the same after reversing the number. Ex: 121, 34543, 343, 131, 48984 are the palindrome numbers. Through this logic, we create a program to deter ...

read moreFactorial of n is the product of all positive descending integers. Factorial of n is denoted by n!. For example 7! =7*6*5*4*3*2*1. By implementing this logic we create a program to find the fact ...

read moreFibonacci series represents a set of numbers where the next number is equal to the sum of the previous two numbers. Ex: 0, 1, 1,2,3,5 etc. The first two numbers of the Fibonacci series are 0 and 1. So ...

read moreA leap year is exactly divisible by 4 except for century years (years ending with 00). The century year is a leap year only if it is perfectly divisible by 400. Based on this concept, we write a progr ...

read moreBubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. We write a simple c program for bubble sort by keeping the logic i ...

read moreThis C Program calculates the GCD and LCM of two integers. Here GCD means Greatest Common Divisor. For two integers a and b, if there are any numbers d so that a / d and b / d doesnâ€™t have any remai ...

read moreRemoving duplicates from an array is a very common interview question. For your reference, we have written the program and its compiled and tested. If you are preparing for the interview make su ...

read more