Problem statement: Given a Binary Heap, perform the operations Delete() , Decreasekey() and BuildHeap(). Disclaimer: Don’t jump directly to the

Continue reading# Tag: DSA Self Paced

## Binary Heap Heapify and Extract Min

Problem statement : Given a Binary Heap, Implement Hepify() and ExtractMin() operations on Binary Heap. Disclaimer: Don’t jump directly to

Continue reading## Insert in Binary Heap

Problem Statement: Given a Binary Heap, Insert the new value in the Binary Heap. Solution : Disclaimer: Don’t jump directly

Continue reading## Binary Heap Implementation

Binary Heap: A Binary Heap is a Binary Tree that satisfies the following conditions. It should be a Complete Binary

Continue reading## Spiral Traversal of Matrix

Problem Statement: Given a Matrix, print the given matrix in spiral order. Examples: Example 1: Input: Matrix[][] = { {

Continue reading## Prefix Sum Technique

In an array of integers n, the prefix sum array is the array whose every element is the sum of

Continue reading## KMP Algorithm

Problem Statement: Implement the Knuth-Morris-Pratt KMP string matching algorithm. Examples: Example 1: Input: String = ”aaaaaaaamaaaaaab” and Pattern = “aaaaaab”

Continue reading## Count digits in a number

Problem Statement: Given an integer N , write program to count number of digits in N. Examples: Example 1: Input:

Continue reading## Evaluation of Postfix Expression

Given a postfix expression Containing only operators [+, – , *, / ] and numbers. Postfix expression is given the

Continue reading## Delete kth node of circular linked list

Problem Statement: Given a circular linked list, delete the kth node of the circular linked list. Example: Example 1: Input:

Continue reading