F1. Tree Cutting (Easy Version

F1. Tree Cutting (Easy Version) Topic: DFS Concept: প্রতিটা প্যারেন্ট এর চাইল্ড কোন কোন কালার আছে তার হিসাব রাখবো, যেমন প্রথম উদাহরনে - ১ নং নোডের চাইল্ড এর সংখ্যা হবে ১টা লাল, ২টা নীল , ১টা নরমাল। ২ নং নোডের চাইল্ড এর সংখ্যা হবে ১টা লাল, ১টা নীল , ২টা নরমাল। ৩ নং এর ১টা নরমাল (নিজের কালার)। ৪ নং নোডের চাইল্ড এর সংখ্যা হবে ১টা লাল ( এইটা বাদ...

Share:

Read More

C. Connect

C. Connect Topic: BFS, Flood Fill, DFS 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...

Share:

Read More

Segment Tree

                                                    Resource Link:  টিউটোরিয়াল গুলো ক্রম অনুযায়ী সাজানো নাই। ডাটা স্ট্রাকচার: সেগমেন্ট ট্রি-১ ডাটা স্ট্রাকচার: সেগমেন্ট ট্রি-২ (লেজি প্রপাগেশন) Kaidul blog  blog  Segment...

Share:

Read More

Bucket Sort

                  Bucket Sort geeksforgeeks hackerearth visualization Time Complexity: If we assume that insertion in a bucket takes O(1) time then steps 1 and 2 of the above algorithm clearly take O(n) time. The O(1) is easily possible if we use a linked list to represent a bucket (In the following...

Share:

Read More

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