Skip to content

Latest commit

 

History

History
85 lines (68 loc) · 2.84 KB

README.md

File metadata and controls

85 lines (68 loc) · 2.84 KB
Raw

Solution uploading..!! Work in progress

lightoj-Problem_Solution

Lightoj user id : 9129 / Saiful Barih (Maruf) All the problem statement are updated in pdf format.

Beginners Problems

  • All Problems : 34/34

Advanced Search Techniques

  • Binary Search/Bisection : 18/20
  • Ternary Search : 2/2

Data Structure

  • Basic Data Structure : 3/3
  • Binary Indexed Tree : 6/8
  • Binary Search Tree : 2/3
  • Hash : 1/2
  • Orthogonal Range Search : 3/6
  • Range Minimum Query/Lowest Common Ancestor : 4/7
  • Segment Tree : 20/23
  • Trie Tree : 4/4

Divide and Conquer

  • Discrete Logarithm/Shank`s Baby-step Giant-step : 0/1
  • Dynamic Programming : 85/106
  • Greedy : 12/14

Recursion/Branch and Bound

  • Backtracking with Pruning/Branch and Bound : 0/1
  • Basic Recursion : 1/2
  • IDA* Search : 1/4
  • Parsing/Grammar : 0/2

Geometry

  • Basic Geometry : 16/18
  • Computational Geometry : 7/12
  • Convex Hull : 3/4
  • Pick`s theorem : 1/1

Matrix

  • Gaussian Elimination : 0/4
  • Matrix Exponentiation : 7/13

Flow/Matching

  • Bipartite Matching : 8/13
  • Max Flow/Min Cut : 13/15
  • Min Cost Max Flow : 5/7
  • Weighted Bipartite Matching/Hungarian Algorithm : 2/4

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

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

String

  • Aho Corasick : 1/1
  • Knuth-Morris-Pratt : 2/5
  • Suffix Array/Suffix Tree : 0/3

Special Thanks: All the solutions dedicated to my trainer Tarif Ezaz and my friend Mohammad Abdullah Matin Khan Zarzis from whom I learned to think.

I also want to mention some of the other special names for their tremendous support. Nafis Ahmed, Mohammad Samiul Islam, Zobayer Hasan, Forhad Ahmed and Leonardo Boshell

NOTE : I don't claim all of the soutions to be mine. While I was solving the problems, I took help from different peoples and see other people's code for many problems. But I never submit any code without my complete understanding. I suugest those who will be following the repo to do so. Pasting code to online judges won't take you any further except frustration.

NOTE :Thanks to Chowdhury Tushar for providing all the problem statements in pdf format from lightoj.com