Heap sort is a sorting algorithm that sorts data in ascending or descending order using the input data. It is

Continue reading# Tag: DSA Self Paced

## Lexicographic Rank of a String

Problem Statement: You are given a string, find its lexicographical rank among all its permutations. Example: Example 1: Input: S

Continue reading## Two stacks in an array

Problem Statement: You need to try implementing 2 stacks in a single array. Example: push1(10): Insert 10 in stack1 push2(21):

Continue reading## BuildHeap(), DecreaseKey(), and Delete() in Binary Heap

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

Continue reading## 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