Maximum flow problem

Resources: wikipedia.org ম্যাক্সিমাম ফ্লো (১) ম্যাক্সিমাম ফ্লো (২) Topcoder tutorial link One problem solution discussion CP Algorithms Implementation: This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below....

Share:

Read More

Maximum Number of Points in a Line

Resources:  wikipedia.org ==>> Collinearity GFG  How To Determine If Points Are Collinear In Coordinate Geometry?  Collinear  Maximum Number of Points in a Line  Implementation basis Spoj & Codechef problem: This file contains bidirectional...

Share:

Read More

A* search algorithm

Resources: wikipedia.org ==> A*_search_algorithm hackerearth blog GFG stanford.edu hackerrank Problems implementation from Youtube Video: This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review,...

Share:

Read More

Expression parsing

Resources: Cp_Algorothm Problem Link: 1309 - Children`s Math 1324 - Equivalent Boolean Expressions 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...

Share:

Read More

Suffix Automaton

Resources: cp-algorithms saisumit implementation CF-blog Good blogs 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

Suffix Tree

Resources: Tushar Roy  CF blog  stanford.edu-lectures   Code library CP_algorithms  HackerEarth  GeeksForGeeks  blogs  TMP01-cc implementation  Implementation: This file contains bidirectional Unicode text that may be interpreted...

Share:

Read More

D - Coloring Edges on Tree

Problem link: Coloring Edges on Tree Explanation: GfG 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 characters. ...

Share:

Read More

Cutting a Rod

Cutting a Rod Tushar Roy Video  Medium blog post  Implementation 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

Edit Distance

Edit Distance 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

Word Wrap Problem (text justification)

Resources: Tushar Roy Video   LeetCode Video MIT Lecture  Github link  Code:   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

Longest Increasing Subsequence (LIS)

Resource: Longest Increasing Subsequence (GFG)  LIS and variation   ডাইনামিক প্রোগ্রামিং এ হাতেখড়ি-৪  Problem: 990 - Diving for Gold  1501. Sense of Beauty  1167. Bicolored Horses  231 - Testing the CATCHER  10926 - How Many Dependencies?  10000 - Longest Paths  XMEN   SOLUTTION 10635...

Share:

Read More

Longest Common Subsequence ( LCS )

Resources: ডাইনামিক প্রোগ্রামিং: লংগেস্ট কমন সাবসিকোয়েন্স GeekGeeks  Practice Dynamic Programming! Educational DP Contest: F - LCS  Tushar Roy Video DP: Find elements of LCS ( Hackerrank Problem )   Code: This file contains bidirectional Unicode text...

Share:

Read More

স্ট্রংলি কানেক্টেড কম্পোনেন্ট

                               Resource: গ্রাফ থিওরিতে হাতেখড়ি ১৪ – স্ট্রংলি কানেক্টেড কম্পোনেন্ট Finding strongly connected components Building condensation graph This file contains bidirectional...

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

F1. Tree Cutting (Easy Version

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

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

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