# Category - C Programming

## C Programming – Backtracking Set 7 Sudoku

C Programming - Backtracking Set 7 Sudoku - Backtracking - Given a partially filled 9×9 2D array ‘grid[9][9]’, the goal is to assign digits (from 1 to 9)

## C Programming-Efficient way to multiply with 7

C Programming-Efficient way to multiply with 7 - Bit Algorithm-We can multiply a number by 7 using bit wise operator. First left shift the number by 3 bits.

## Write a C program to find the parity of an unsigned integer

Write a C program to find parity of an unsigned integer - Bit Algorithm - Parity of a number refers to whether it contains an odd or even number of 1-bit

## C Programming-Write an Efficient Method to Check if a Number is Multiple of 3

C Programming-Write an Efficient Method Check if a Number is Multiple of 3 -If sum of digits in a number is multiple of 3 then number is multiple of 3 e.g.,You...

## C Programming-Smallest power of 2 greater than or equal to n

C Programming-Smallest power of 2 greater than or equal to n - Bit Algorithm - Write a function that, for a given no n, finds a number p which is greater

## C Programming – Floyd Warshall Algorithm

C Programming - Floyd Warshall Algorithm - Dynamic Programming The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem.

## C Programming – Longest Bitonic Subsequence

C Programming - Longest Bitonic Subsequence - Dynamic Programming Array arr[0..n-1] containing n positive integers, a subsequence of arr[] is called Bitonic

## C Programming – Replace all ‘0’ with ‘5’ in an input Integer

C Programming - Replace all ‘0’ with ‘5’ in an input Integer - Mathematical Algorithms - The idea is simple, we get the last digit using mod operator ‘%’.

## Count set bits in an integer in C Programming

Count set bits in an integer in C Programming - Bit Algorithm - Simple Method Loop through all bits in an integer, check if bit is set and if then increment

## C Programming – Maximum Sum Increasing Subsequence

C Programming - Maximum Sum Increasing Subsequence - Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum