let's start Code

Sqrt Decomposition

Resoures: E-Maxx Shafayet blog  Rezwan's CP Blog   Anudip blog  Tanvir's Blog  MO'S Algo  One problem-solution discussion 2D SQRT  MO’s Algorithm (Query square root decomposition) Mo's algorithm (HackerEarth) GeeksForGeeks CF blog: 1 2 Cf blog3  CF blog4 [Tutorial] Two ways to apply Mo's...
Share:

C. Codejamon Cipher

C. Codejamon Cipher Explanation: Google Dynamic Programming Problem (APAC 2017 Round D)  Code:   This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file...
Share:

0/1 KnapSack

Resources:  GeeksForGeeks HackerEarth  Codeforces  CF blog    Code: 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...
Share:

E-maxx training part - 04

Minimum stack / Minimum queue Implementation  Sparse Table RMQSQ - Range Minimum Query   SOLUTION THRBL - Catapult that ball Matchsticks Sereja and D D. CGCDSSQ D. R2D2 and Droid Army B. Maximum of Maximums of Minimums TNVFC1M - Miraculous DCP-19: Multiplication Interval D. Animals and Puzzle E. Trains...
Share:

Sparse Table

Note: Sparse Table is a data structure, that allows answering range queries. It can answer most range queries in span class="MathJax" data-mathml="O(log⁡n)" id="MathJax-Element-1-Frame" role="presentation" style="position: relative;" tabindex="0">O(logn), but its true power is answering range minimum queries (or equivalent range maximum...
Share:

Github Link

RezwanArefin01 Shafaet  ACM-ICPC-Algorithms  ADJA/algos  USACO  Ashishgup1/Competitive-Coding  abeaumont/competitive-programming  keon/algorithms (But, codes in python)  GitHub Repositories With Competitive Programming Libraries  &nbs...
Share:

Chinese Remainder Theorem

Resources: Chinese Remainder Theorem  Chinese Remainder Theorem ( E-Maxx)   GeeksForGeeks  forthright48 - Coprime Moduli part1   forthnight48- Non Coprime Moduli part 2  Codeforces article Problems: Chinese Remainder Theorem (non-relatively prime moduli)  Cheese and Random Toppings    SOLUTION  1319...
Share:

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 hidden or bidirectional...
Share:

Number of single cycle components in an undirected graph (CF-977E)

E. Cyclic Components resource হিন্টঃ প্রতিটি কম্পোনেন্ট এ চেক করবো তাদের প্রত্যেকটি নোডের ডিগ্রি দুই কিনা, যদি দুই হয় তাইলে সেটা একটা সিঙ্গেল সাইকেল কম্পোনেন্ট। This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than...
Share:

E-maxx training part - 03

Modular Multiplicative Inverse UVa 11904 - One Unit Machine      SOLUTION Longest Increasing Subsequence Arrays  SOLUTION C. Beautiful Numbers  F. The Sum of the k-th Powers  A. Festival Organization  D. Nephren Runs a Cinema    Chinese Remainder Theorem Number of Sequences  E....
Share:

About

let's start CODE

Popular Posts