go-algorithms

Algorithms written in golang

Dynamic Programing

• If Subset Sum Available
  
• If Equal Sum Subset Available
  
• Count of Subsets for a given sum
  

Binary Search

• Rotation Count in Rotated Sorted array
  
• Rotated Sorted Array Search
  
• Search in nearly sorted array
  
• Floor of an element in a sorted array
  

Coursera Algorithms Specialization

• Divide And Conquer