LightOj-Problem-Solution-By-Saurav-Paul

Light Oj Problem solution

Name		Name	Last commit message	Last commit date
Latest commit History 136 Commits
Articulation,Bridge,Biconnected Component		Articulation,Bridge,Biconnected Component
BFS DFS		BFS DFS
Basic Data Structures		Basic Data Structures
Basic Geometry		Basic Geometry
Basic Math		Basic Math
Basic Recursion		Basic Recursion
Beginner Problems		Beginner Problems
Bellman Ford		Bellman Ford
Binary Search , Bisection		Binary Search , Bisection
Cycle , Topological Sorting , Strongly Connected Component		Cycle , Topological Sorting , Strongly Connected Component
Dijktra , Floyd Washall		Dijktra , Floyd Washall
Dynamic Programming		Dynamic Programming
Greedy		Greedy
Knuth-Morris-Pratt		Knuth-Morris-Pratt
Minimum Spanning Tree		Minimum Spanning Tree
Nim		Nim
Number Theory		Number Theory
Probability,Expected Value		Probability,Expected Value
Segment Tree,Interval Tree		Segment Tree,Interval Tree
Sprague-Grundy Number		Sprague-Grundy Number
Stable Marriage Problem		Stable Marriage Problem
Weighted Bipartite Matching,Hungarian Algorithm		Weighted Bipartite Matching,Hungarian Algorithm
11488 - Hyper Prefix Sets.cpp		11488 - Hyper Prefix Sets.cpp
1427 - Substring Frequency (II) .cpp		1427 - Substring Frequency (II) .cpp
README.md		README.md

Provide feedback