## C Programming – Ugly Numbers

C Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every step we choose the smallest one

## C Program-Swap two nibbles in a byte

C Program Swap two nibbles in a byte – Bit Algorithm – A nibble is a four-bit aggregation, or half an octet. There are two nibbles in a byte.

## C Programming – Inserting a node in Linked List | Set 2

C Programming -Time complexity of append is O(n) where n is number of nodes in linked list. Since there is a loop from head to end, the function does O(n)

## C program to check subsequence

C program to check subsequence – C Programming – User will input two strings and we find if one of the strings is a subsequence of other.

## Substring in c programming

Substring in c programming – C Programming – c programming code to find a substring from a given string and for all substrings of a string.

## C Programming – Program for Fibonacci numbers

C Programming – Program for Fibonacci numbers – Dynamic Programming The Fibonacci numbers are the numbers in the following integer sequence.

## C Programming – Vertex Cover Problem | Set 1 (Introduction and Approximate Algorithm)

C Programming – Vertex Cover Problem – Introduction and Approximate Algorithm – It can be proved that the above approximate algorithm never finds a vertex

## C Programming – Backtracking | Set 6 (Hamiltonian Cycle)

C Programming – Backtracking – Hamiltonian Cycle – Create an empty path array and add vertex 0 to it. Add other vertices, starting from the vertex 1

## C Programming – Word Wrap Problem

C Programming – Word Wrap Problem – Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line

## C programming – Check if a graph is strongly connected

C programming – Check if a graph is strongly connected – A directed graph is strongly connected if there is a path between any two pair of vertices