## C Program for Egg Dropping Puzzle | DP-11

The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors. Suppose that we wish… Read More »

- Interesting Facts in C Programming | Set 2
- time.h header file in C with Examples
- TCP Client-Server Program to Check if a Given String is Palindrome
- Lex program to implement a simple Calculator
- What is a Pointer to a Null pointer
- 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 find the Length of a String
- How to Append a Character to a String in C
- time.h localtime() function in C with Examples
- Lex program for Decimal to Hexadecimal Conversion
- Lex program to check perfect numbers
- Lex program to check whether input number is odd or even
- Lex code to replace a word with another word in a file
- C program to print the length of a String using %n format specifier

The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors. Suppose that we wish… Read More »

Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least… Read More »

You are given n activities with their start and finish times. Select the maximum number of activities that can be performed by a single person,… Read More »

Given a sequence of matrices, find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but… Read More »

Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1,… Read More »

Given an array of integers where each element represents the max number of steps that can be made forward from that element. Write a function… Read More »

Given a cost matrix cost[][] and a position (m, n) in cost[][], write a function that returns cost of minimum cost path to reach (m,… Read More »

Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up to a given number K. We… Read More »

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example,… Read More »

We have discussed Backtracking and Knight’s tour problem in Set 1. Let us discuss Rat in a Maze as another example problem that can be… Read More »

The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of 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[] in txt[]. You may… Read More »

The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..… Read More »