Heap Sort

                          Heap Sort Time Complexity: Time complexity of heapify is O(nLogn). Time complexity of createAndBuildHeap() is O(n) and overall time complexity of Heap Sort is O(nLogn). hackerearth GeeksForGeeks visualization ...

Share:

Read More

Radix Sort

Radix Sort Visualization                                       Complexity:  O(n+b)*logb(max_value) This file contains hidden or bidirectional Unicode text that may be interpreted...

Share:

Read More

Counting Sort

                    Counting Sort                        Counting Sort This file contains hidden or bidirectional Unicode text that may be interpreted or compiled...

Share:

Read More

Binary Search Tree (BST)

Binary Search Tree Binary Search Tree (BST) is a node-based binary tree data structure having the following properties: The left subtree of a node contains only nodes with keys less than the node’s key. The right subtree of a node contaisns only nodes with greater than...

Share:

Read More

Odd Sum SubSequence

problem statement: You are given sequence *a[1]*, *a[2]*, ..., *a<[n]* of integer numbers of length *n*. Your task is to find such subsequence that its sum is odd and maximum among all such subsequences. It's guaranteed that given sequence contains subsequence with odd sum. Subsequence is a sequence that can be derived from another sequence by...

Share:

Read More

Fractional Knapsack Problem

Fractional Knapsack Problem This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode...

Share:

Read More

Egyptian Fraction

      Egyptian Fraction This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about...

Share:

Read More

Activity Selection Problem

                      Resource: GeeksForGeeks Activity Selection Problem techiedelight                  Implementation: 01 ...

Share:

Read More

Two Pointer

                          Resource Link: Shakil Ahmed's Blog  The Two Pointer Algorithm Problems: 1121 - Subsequence 11536 - Smallest Sub-Array ARRAYSUB - subarrays Chef and Cake...

Share:

Read More

1121 - Subsequence

1121 - Subsequence Topic: two pointer explanation: Shakil Ahmed's Blog solution 01:   This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden...

Share:

Read More