Skip to content
/ AdvancedDS Public

implementations for advanced data structures with optimized time complexity

0 stars 2 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

pranavbhole/AdvancedDS

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
gradle/wrapper
gradle/wrapper
 
 
src
src
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 
build.gradle
build.gradle
 
 
gradlew
gradlew
 
 
gradlew.bat
gradlew.bat
 
 
settings.gradle
settings.gradle
 
 

Repository files navigation

AdvancedDS

  • Following qs are coded in the unique way with simplified and optimized solution by me. I have not copied the code from any other sources.

RMQ (Range Minimum Queries)

  1. Sparse Table
  2. Segment Tree (using pointers)
  3. Square Root Decomposition

Dynamic Programming

  1. Coin Change
  2. Painting Fence
  3. Generic Recurrence Relations
  4. SubSetSum and SubSetSum Divisible s
  5. Ugly Numbers
  6. Edit Distance
  7. 0/1 Knapsack
  8. Longest Common Subsequence
  9. Max Length Snake Seq
  10. Egg Dropping Puzzle
  11. Matrix Chain Multiplication

About

implementations for advanced data structures with optimized time complexity

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

2 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages