android, kotlin, linux, docker, asop, web
Home
Categories
Tags
©2017 - 2024. All rights reserved.
multixlab
Union-Find (Disjoint-Set)
Data-structures
Finding the lowest common ancestor (LCA) using Euler tour and sparse table
Algorithms
Finding LCA of two nodes in a tree
Algorithms
Range queries - sparse table
Data-structures
Range queries - creating prefix sum of a 2D array
Data-structures
Segment tree
Data-structures
Binary Indexed Tree (BIT) or Fenwick tree
Data-structures
Prim's minimum spanning tree
Algorithms
Kruskal's minimum spanning tree
Algorithms
Isomorphic Trees - AHU Algorithm
Algorithms
Find center of a tree
Algorithms
Rooting a tree at a specific node
Algorithms
Combinations
Algorithms
Permutations
Algorithms
Dijkstra's shortest path algorithm
Algorithms
Detecting negative cycle - Bellman-Ford algorithm
Algorithms
Tarjan's strongly connected components
Algorithms
Single source shortest path - DAG
Algorithms
Topological sort using Kahn's algorithm
Algorithms
Topological sort using DFS
Algorithms
Older
Newer
top