Bidirectional Search
Hello people! In this post we will talk about Bidirectional Search, a powerful search strategy which can be used if you have […]
Author: Vamsi
Iterative Deepening Depth First Search (IDDFS)
Hello people! In this post we will talk about another search algorithm Iterative deepening depth first search (IDDFS) or Iterative deepening search […]
N-ary tree or K-way tree data structure
N-ary tree is defined as a rooted tree which has at most N children for any node. So, a binary tree is a special case of the N-ary tree, where N = 2. We ca implement an N-ary tree using structures or using arrays.
Rotate matrix clockwise
Problem statement – Given an array of N rows and N columns (square matrix), rotate the matrix by 90° in clockwise direction. […]
Print matrix in spiral order
Problem statement – Given a 2D array (or matrix) of N rows and M columns, print it in a spiral order. Example, […]
Add one to digit array
Problem statement – Given a non-negative integer in the form of an array of digits, add one to digit array. The digits […]
Adjacency List with String vertices using C++ STL
Hello people..! This is a special extension for my discussion on Graph Theory Basics. Here, I give you the code for implementing […]
Minimax algorithm with Alpha-Beta Pruning
Improve the performance of Minimax algorithm by applying Alpha-Beta Pruning. Alpha-beta pruning is based on the Branch and bound algorithm design paradigm where we discard any decision which cannot possibly yield a better solution than the one we have so far.
First missing integer in an unsorted array
Problem statement – Given an unsorted integer array, find the first missing positive integer. Example, If A = [-1, 4, 2, 3, […]
Maximum sum contiguous sub-array
Find a contiguous sub-array whose sum is maximum. Using the dynamic programming based Kadane’s Algorithm, we can solve this in O(N) time.