1049 - One Way Roads

1049 - One Way Roads Topic: DFS concept: কস্টকে ডিরেক্টটেড ধরবো তারপর আনডিক্টটেড গ্রাফ এ ডিএফএস চালাবো. This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals...

Share:

Read More

1263 - Equalizing Money

1263 - Equalizing Money Topic: BFS Concept: সব গুলা কম্পোনেন্ট এ চেক করবো সমান পরিমান টাকা আছে কিনা। This file contains 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

TOPOSORT - Topological Sorting

TOPOSORT - Topological Sorting Topic: Topological Sorting This file contains 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...

Share:

Read More

Topological Sorting

                                                 Resource Link Topological Sorting (E-Maxx) Kahn’s algorithm for Topological Sorting Topological Sorting TopSort using DFS: ...

Share:

Read More

1002 - Country Roads

1002 - Country Roads Topic: dijkstra solution 01: This file contains 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

Dijkstra Algorithm

                                               Resource Link Dijkstra Algorithm Dijkstra on sparse graphs This file contains bidirectional Unicode text...

Share:

Read More

1005 - Rooks

1005 - Rooks Topic: combinatorics + Binomial Coefficient This file contains 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...

Share:

Read More

Binomial Coefficient

Binomial Coefficient This file contains 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 characters ...

Share:

Read More

DCP-23: Another Bigmod Problem

DCP-23: Another Bigmod Problem Topic: BigMod solution: This file contains 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

1067 - Combinations

1067 - Combinations Topic: Counting. This file contains 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

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 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 bidirectional Unicode text that may be interpreted or...

Share:

Read More

Counting Sort

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

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 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 characters ...

Share:

Read More

Egyptian Fraction

      Egyptian Fraction This file contains 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

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 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...

Share:

Read More

Closest Pair of Points

Resources:  cp-algorithms Closest Pair of Points Closest Pair of Points Problem concept another explanation This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor...

Share:

Read More

Counting Inversions

Merge Sort: Counting Inversions Concept:  Count Inversions in an array Implementation: This file contains 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...

Share:

Read More

QuickSort

                                           Resource Link Quick Sort Hasaner Rafkhata Visualization GeeksForGeeks                                    ...

Share:

Read More

Merge Sort

                                            Resource Link GeeksForGeeks Visualization Hackerearth হাসানের রাফখাতা                                    ...

Share:

Read More

Binary Search

Binary Search 01. বাইনারি সার্চ – ১(শাফায়েত আশরাফ) 02. বাইনারি সার্চ - ২(বাইসেকশন) - শাফায়েত আশরাফ 03. বাইসেকশন মেথড - আহমাদ ফাইয়াজ 04. বাইনারি সার্চ - হাসান আবদুল্লাহ 05. Painless Binary Search - আবু আসিফ খান চৌধুরী 06. Binary Search part - 1 - শাকিল আহমেদ 07. TopCoder Tutorial 08. One Problem from...

Share:

Read More

Breadth First Search

                                                 Blog Link: গ্রাফ থিওরিতে হাতেখড়ি-৪(ব্রেডথ ফার্স্ট সার্চ) Visualization  visualgo.net  ট্রি...

Share:

Read More