let's start Code

Find n-th lexicographically permutation of a string

Find n-th lexicographically permutation of a string Complexity: O(string length)   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...
Share:

11029 - Leading and Trailing

11029 - Leading and Trailing  Topic: Binary Exponentiation   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:

1230 - MODEX

1230 - MODEX Modular Arithmetic for Beginners  Topic: Binary Exponentiation   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...
Share:

Dual Palindromes

Dual Palindromes 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 characters ...
Share:

Palindromic Squares

Palindromic Squares  একটা সংখ্যার বেস দেওয়া থাকবে, ঐ বেসে  ১ থেকে ৩০০ এর মঝে যত প্যালিন্ড্রমিক   (সংখ্যাটির বর্গের)   নাম্বার আছে সেগুলা প্রিন্ট করতে হবে। This file contains hidden or bidirectional Unicode text that may be interpreted or compiled...
Share:

INVCNT - Inversion Count

                                                 INVCNT - Inversion Count Topic: BIT This file contains hidden or bidirectional Unicode text that...
Share:

Suffix Array

Resources: CP_Algorithms  Suffix Array stanford.edu  CommonLounge  Youtube: Suffix array playlist  Complexity: O(Nlog^2(n)) This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears...
Share:

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

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

Lost Numbers

Lost Numbers Solution 01: partially AC 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:

March Easy' 19

March Easy' 19 1. Permutations 2. Lost Numbe...
Share:

About

let's start CODE

Popular Posts