# Category - AlgorithmAnalysis of Algorithmartificial intelligenceBacktrackingBit Algorithms:Branch and BoundDivide and ConquerDynamic ProgrammingGeometric AlgorithmsGraph AlgorithmsGreedy AlgorithmMathematical AlgorithmsRandomized AlgorithmsSearching and Sorting

## Sorted order printing of a given array that represents a BST

Sorted order printing of a given array that represents a BST - Binary Search Tree - Given an array that stores a complete Binary Search Tree,

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

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

## Hashing Open Addressing

open addressing is a method for handling collisions. In Open Addressing, all elements are stored in the hash table itself. So at any point, size of table

## Hashing Separate Chaining

Since a hash function gets us a small number for a key which is a big integer or string, there is possibility that two keys result in same value.

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

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

## Hashing Introduction

we use arrays and keep the data sorted, then a phone number can be searched in O(Logn) time using Binary Search, but insert and delete operations

## C++ Programming – Given a matrix of ‘O’ and ‘X’ and find the largest subsquare surrounded by ‘X’

A Simple Solution is to consider every square submatrix and check whether is has all corner edges filled with ‘X’ and the time complexity of this solution.

## Java Programming – Nuts & Bolts Problem

Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts.

## C++ Programming – Flood fill Algorithm

In MS-Paint, when we take the brush to a pixel and click, the color of the region of that pixel is replaced with a new selected color.

## C++ Programming – Given n appointments, find all conflicting appointments

A Simple Solution is to one by one process all appointments from second appointment to last. For every appointment i, check if it conflicts with i-1, i-2, …

X