## C Program for Number of elements with odd factors in given range

Given a range [n, m], find the number of elements that have odd number of factors in the given range (n and m inclusive). Examples:… Read More »

- C program to store Student records as Structures and Sort them by Name
- TCS Coding Practice Question | Check Palindrome Number
- TCS Coding Practice Question | Reverse a String
- C program to check if a given string is Keyword or not
- TCS Coding Practice Question | Palindrome String
- TCS Coding Practice Question | Reverse a Number
- Draw a moving car using computer graphics programming in C
- Check whether the given character is in upper case, lower case or non alphabetic character
- Program for conversion of 32 Bits Single Precision IEEE 754 Floating Point Representation
- Check whether the number can be made perfect square after adding 1
- Lex Program to check valid email
- Interesting Facts in C Programming | Set 2
- Lex Program to accept a valid integer and float value
- How to get the current position of cursor from output screen in C?
- Lex program to find the length of the longest word
- Lex Program to accept string starting with vowel
- Lex Program to remove comments from C program
- Lex Program to print the total characters, white spaces, tabs in the given input file
- Lex program to search a word in a file
- C program to store Student records as Structures and Sort them by Age or ID
- Lex program to check perfect numbers
- Lex program to implement a simple Calculator
- Lex program to find the Length of a String
- Lex program for Decimal to Hexadecimal Conversion
- Lex program to check whether input number is odd or even
- Lex code to replace a word with another word in a file

Given a range [n, m], find the number of elements that have odd number of factors in the given range (n and m inclusive). Examples:… Read More »

Given a number x, determine whether the given number is Armstrong number or not. A positive integer of n digits is called an Armstrong number… Read More »

This is basically a variation of bubble-sort. This algorithm is divided into two phases- Odd and Even Phase. The algorithm runs until the array elements… Read More »

Given a number “n”, find its total number of divisors is even or odd. Examples : Input : n = 10 Output : Even Input:… Read More »

Given a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive… Read More »

Given a value V, if we want to make change for V Rs, and we have infinite supply of each of the denominations in Indian… Read More »

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

Following is a typical recursive implementation of Merge Sort that uses last element as pivot. filter_none edit close play_arrow link brightness_4 code /* Recursive C… Read More »

Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each… Read More »

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs… Read More »

We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort find use binary search to find the… Read More »

Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] and its permutations (or… Read More »

Given a positive integer N, count all possible distinct binary strings of length N such that there are no consecutive 1’s. Examples: Input: N =… Read More »

Area of a circle can simply be evaluated using following formula. Area = pi * r2 where r is radius of circle filter_none edit close… Read More »