Server Time: Tue Jul 23, 2019 12:27 am
Welcome ( logout

Categorized Problems for Shafaet Ashraf

Category List Problem Solved/Total Problem Solved/Tried
 
Advanced Search Techniques
Binary Search/Bisection
Ternary Search
9 / 20
2 / 2
9 / 10
2 / 2
 
Beginners Problems
Beginners Problems
12 / 39
12 / 13
 
Data Structures
Basic Data Structures
Binary Indexed Tree
Binary Search Tree
Hashing
Orthogonal Range Search
Range Minimum Query/Lowest Common Ancestor
Segment Tree/Interval Tree
Trie Tree
0 / 3
5 / 8
3 / 3
0 / 2
1 / 5
6 / 7
19 / 23
4 / 4
0 / 0
5 / 5
3 / 3
0 / 0
1 / 1
6 / 6
19 / 19
4 / 4
 
Divide and Conquer
Discrete Logarithm/Shank`s Baby-step Giant-step Algorithm
Dynamic Programming
Greedy
0 / 1
73 / 106
9 / 14
0 / 0
73 / 76
9 / 10
 
Flow/Matching
Bipartite Matching
Hopcroft–Karp Bipartite Matching
Max Flow/Min Cut
Min Cost Max Flow
Weighted Bipartite Matching/Hungarian Algorithm
11 / 13
2 / 2
8 / 15
5 / 7
2 / 4
11 / 12
2 / 2
8 / 8
5 / 5
2 / 2
 
Game Theory
Green Hackenbush/Colon Principle/Fusion Principle
Nim
Sprague-Grundy Number
0 / 1
5 / 5
6 / 6
0 / 0
5 / 5
6 / 6
 
Geometry
Basic Geometry
Computational Geometry
Convex Hull
Pick`s theorem
8 / 18
2 / 12
3 / 4
1 / 1
8 / 8
2 / 3
3 / 3
1 / 1
 
Graph Theory
2-SAT
Articulation/Bridge/Biconnected Component
Bellman Ford
Breadth First Search/Depth First Search
Cycles/Topological Sorting/Strongly Connected Component
Dijkstra/Floyd Warshall
Directed Minimum Spanning Tree
Euler Trail/Circuit
Heavy-Light Decomposition
Minimum Spanning Tree
Stable Marriage Problem
1 / 2
5 / 5
2 / 3
14 / 27
3 / 8
5 / 10
2 / 2
2 / 3
1 / 1
3 / 6
1 / 1
1 / 1
5 / 5
2 / 2
14 / 16
3 / 4
5 / 8
2 / 2
2 / 2
1 / 1
3 / 3
1 / 1
 
Math
Basic Math
Big Integer Arithmetic
Chinese Remainder Theorem
Counting
Extended Euclid
Group Theory/Burnside`s lemma
Inclusion/Exclusion
Modular Arithmetic
Number Theory
Probability/Expected Value
6 / 19
0 / 1
0 / 1
10 / 21
0 / 1
0 / 1
2 / 4
3 / 4
12 / 36
12 / 17
6 / 6
0 / 0
0 / 0
10 / 11
0 / 0
0 / 0
2 / 2
3 / 3
12 / 12
12 / 13
 
Matrix
Gaussian Elimination
Matrix Exponentiation
3 / 4
8 / 13
3 / 3
8 / 9
 
Recursion/Branch and Bound
Backtracking with Pruning/Branch and Bound
Basic Recursion
IDA* Search
Parsing/Grammar
0 / 1
0 / 2
0 / 4
0 / 2
0 / 0
0 / 0
0 / 1
0 / 0
 
String
Aho Corasick
Knuth-Morris-Pratt
Suffix Array/Suffix Tree
0 / 1
4 / 5
2 / 3
0 / 0
4 / 5
2 / 3
Developed and Maintained by
JANE ALAM JAN
Copyright © 2012
LightOJ, Jane Alam Jan