Have any question ?
+91 8080-806-983
interviewprep@appliedroots.com
Register
Login
COURSES
C Programming
Interview Preparation Course
CRT Program
Diploma in AI and ML
Courses
C Programming
Interview Preparation Course
Success Stories
Forum
FAQ'S
Team
Contact Us
Home
Courses
Interview Preparation Course
Disjoint sets and operations (Union and find)
Disjoint sets and operations (Union and find)
Instructor:
admin
Duration:
29 mins
Full Screen
Close
This content is restricted. Please
Login
Prev
Next
LRU Cache: Python Code [Leetcode]
Friend Circles: Problem Statement [Leetcode]
Trie
1.1
Tries
33 min
1.2
Implement Tries: Problem Statement [Leetcode]
3 min
1.3
Implement Tries: Explanation [Leetcode]
11 min
1.4
Implement Tries: Python Code [Leetcode]
12 min
Red Black Trees
2.1
Red black Trees
31 min
2.2
Red Black Tree - Deletion
18 min
B-Trees & B+ Trees
3.1
Files and Indexing: introduction
46 min
3.2
B-Trees and B+ Trees with examples
58 min
3.3
More Solved Problems
14 min
3.4
Terminology related to Indexes
9 min
Ternary search Tree
4.1
Ternary Search Tree
35 min
LRU Cache
5.1
Page replacement Strategies
34 min
5.2
LRU, Optimal-replacement Algorithm
52 min
5.3
LRU Cache: Problem Statement [Leetcode]
6 min
5.4
LRU Cache: Why Use a Cache [Leetcode]
7 min
5.5
LRU Cache: Eviction [Leetcode]
7 min
5.6
LRU Cache: Explanation [Leetcode]
12 min
5.7
LRU Cache: Python Code [Leetcode]
22 min
Disjoint sets
6.1
Disjoint sets and operations (Union and find)
29 min
6.2
Friend Circles: Problem Statement [Leetcode]
4 min
6.3
Friend Circles: Approach 1 [Leetcode]
5 min
6.4
Friend Circles: Approach 1 (python code) [Leetcode]
7 min
6.5
Friend Circles: Approach 2 and python code [Leetcode]
16 min
Segment Tree
7.1
Introduction & Navie Approach
7 min
7.2
Structure of segment Tree
8 min
7.3
Constructing Segment Tree
12 min
7.4
Range Sum Query
11 min
Complexity Classess
8.1
Introduction
7 min
8.2
What is Non-Deterministic and Deterministic Algorithms ?
8 min
8.3
How to show the relationship between exponential time algorithms?
8 min
8.4
NP-Hard And NP-Complete
12 min
Close