let's start Code

SUBXOR - SubXor

SUBXOR - SubXor Subarray Xor Topic: Trie Tree  Explanation  Solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 ...
Share:

Video Conference

Video Conference Topic: trie //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 vector<string> solve (vector<string> names) { unordered_set<string> s; unordered_map<string, int> mp; vector<string>ans; for(const auto& name: names){ auto it = mp.find(name); ...
Share:

4682 - XOR Sum

4682 - XOR Sum Topic : Trie Tree N.B: Output not print in a single line ): Solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 #include...
Share:

maximum XOR

Maximum XOR value of a pair from a range //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 #include <bits/stdc++.h> using namespace std; #define INF 1<<30 #define MAX 10005 #define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); typedef...
Share:

ট্রাই ট্রি ( Trie Tree )

ট্রাই ট্রি ( Trie Tree ) ডাটা স্ট্রাকচার: ট্রাই (প্রিফিক্স ট্রি/রেডিক্স ট্রি) Trie (Keyword Tree) -- H1 ,  H2 Zobayer blog -- using static array Quora Tutorial  Implemention 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 ...
Share:

793 - Network Connections

793 - Network Connections Topic : DSU Solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 #include <bits/stdc++.h> using...
Share:

Merging Communities

Merging Communities Topic: DSU Solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 #include <bits/stdc++.h> using namespace std; #define INF...
Share:

Disjoint Set Union

Disjoint Set Union Topcoder ডাটা স্ট্রাকচার: ডিসজয়েন্ট সেট(ইউনিয়ন ফাইন্ড) Union Find Algorithm   Codechef  Trick  Problem: Graph connectivity(uva)  Nature-uva Virtual Friends (UVA) BLINNET - Bytelandian Blingors Network (spoj)  CHAIN - Strange Food Chain (spoj) 1671. Anansi's Cobweb (timus) D. Roads not only...
Share:

About

let's start CODE

Popular Posts