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...
Showing posts with label Hackerrank. Show all posts
Showing posts with label Hackerrank. Show all posts
Cut the sticks
Problem link: Cut the sticks
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 Unicode characters
...
Counting Inversions
Merge Sort: Counting Inversions
Concept:
Count Inversions in an array
Implementation:
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...
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);
...
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...
Construct the Array
Construct the Array
Topic: DP
Complexity: O(n)
Solution:
Code:
const long long mod = 1000000000+7;long countArray(int n, int k, int x) { // Return the number of ways to fill in the array. vector<long long> a(n),...