Resources:
Rachit blog
cf blog
cf blog for problem
Youtube Tutorial:
1. GKCS
2. Errichto
3. rachit
Implementation:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than...
Showing posts with label Datastructure. Show all posts
Showing posts with label Datastructure. Show all posts
Palindromic Tree
Resources:
adilet.org-palindromic-tree
Rezwan's CP Blog
Cf blog1
Cf-blog02
geeksForGeeks
Eertree (or palindromic tree)
Problems:
LPS
E. Palindromes in a Tree
TREEPAL
the-story-of-stringland
NUMOFPAL
The Number of Palindromes
Implementation:
...
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...
Slinding Window
Resources:
GeeksforGeeks
medium
techiedelight.com
leetcodeProblem Explanation
Some Example:
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...
Array and simple queries
Problem link: Array and simple queries
Topic Name: Treaps
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 that reveals hidden Unicode characters.
Learn more...
Hashing
Resources:
Threads @ IIIT Hyderabad
Palindrome Substring Queries
Palindrome Substring Queries Implementation
CF blog
CF blog
E-maxx
uniqeSubstring Implementation
group identical implementation
Problems:
Substring Search
1517. Freedom of Choice
ADAPHOTO - Ada and Terramorphing
Minimal Shift
Cyclic...
Lowest Common Ancestor
Resource:
লোয়েস্ট কমন অ্যানসেস্টর
Lowest Common Ancestor, Binary Lifting and HLD
copsiitbhu.co.in
Lowest Common Ancestor - O(N−−√) and O(logN) with O(N) preprocessing
Lowest Common Ancestor - Binary Lifting
Lowest Common Ancestor - Farach-Colton and Bender Algorithm
Solve RMQ (Range Minimum Query) by finding LCA...
Treap (Cartesian tree)
Resources:
E-maxx Algorithms Thread Episode 9: Treaps
carpanese blog
quora-Part-1 Part 2
Cf blog 0
CF Blog 1
CF blog 2
Cf blog 3
Cf blog 4
ACM Cairo Science
Youtube:
2.5+ hours lecture
Algorithm Live
Implementation:
...
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...
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...
1112 - Curious Robin Hood
1112 - Curious Robin Hood
Topic: BIT
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...
INVCNT - Inversion Count
INVCNT - Inversion Count
Topic: BIT
This file contains bidirectional Unicode text that may be interpreted...
Suffix Array
Resources:
CP_Algorithms
Suffix Array
stanford.edu
CommonLounge
Youtube:
Suffix array playlist
Complexity: O(Nlog^2(n))
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To...
In the beginning of the system!
In the beginning of the system!
Eexplanation: Implicit cartesian tree in GNU C++ STL.
Topic: PBDS
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...
পলিসি বেইজড ডাটা স্ট্রাকচার (PBDS)
পলিসি বেইজড ডাটা স্ট্রাকচার (PBDS)
Implicit cartesian tree in GNU C++ STL.
C++ STL: Policy based data structures
Cartesian tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file...
Segment Tree
Resource Link:
টিউটোরিয়াল গুলো ক্রম অনুযায়ী সাজানো নাই।
ডাটা স্ট্রাকচার: সেগমেন্ট ট্রি-১
ডাটা স্ট্রাকচার: সেগমেন্ট ট্রি-২ (লেজি প্রপাগেশন)
Kaidul blog
blog
Segment...
Binary Search Tree (BST)
Binary Search Tree
Binary
Search Tree (BST) is a node-based binary tree data structure having the
following properties:
The left subtree of a
node contains only nodes with keys less than the node’s key.
The right subtree of
a node contaisns only nodes with greater than...
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
...
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);
...
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...