# Category - C Programming

## C Program Lowest Common Ancestor in a Binary Search Tree

C Program Lowest Common Ancestor in a Binary Search Tree - Data Structure - write a c program to find the Lowest Common Ancestor (LCA).

## C Programming – Given two strings, find if first string is a subsequence of second

Given two strings str1 and str2, find if str1 is a subsequence of str2. A subsequence is a sequence that can be derived from another sequence by deleting

## C program to change case of a string

C program to change case of a string - C Programming - Strlwr function convert a string to lower case and strupr function convert a string to upper case.

## C Programming – Count ways to reach the n’th stair

C Programming - Count ways to reach the n’th stair - Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.

## C Programming – Maximum sum rectangle in a 2D matrix

C Programming - Maximum sum rectangle in a 2D matrix - Dynamic Programming Given a 2D array, find the maximum sum subarray in it.For example,

## C Programming – Subset Sum Problem

C Programming - Subset Sum Problem - Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset

## C program to check if a binary tree is BST or not

C program to check if a binary tree is BST or not - Binary Search Tree - A binary search tree (BST) is a node based binary tree data structure.

## C – Programming Tree Traversals (Inorder, Preorder and Postorder)

C - Programming Tree Traversals (Inorder, Preorder and Postorder) - Tree - Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which

## C Algorithm – Write a function that counts the number of times a given int occurs in a Linked List

C Algorithm - Write a function that counts the number of times a given int occurs in a Linked List - Linked List - Given a singly linked list and a key

## C Algorithm – Sort a stack using recursion

C Algorithm - Sort a stack using recursion- Data Structure - Given a stack, sort it using recursion. Use of any loop constructs like while, for..etc