1002 - Country Roads

1002 - Country Roads Topic: dijkstra 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 Unicode characters. Learn...

Share:

Read More

Dijkstra Algorithm

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

Share:

Read More

1005 - Rooks

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

Share:

Read More

Binomial Coefficient

Binomial Coefficient 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

DCP-23: Another Bigmod Problem

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

Share:

Read More

1067 - Combinations

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

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