Important Algorithms for coding interviews 📚

Executing important algorithms using java

Using two approaches to solve the job sequencing problem, both approaches use binary search tree and greedy algorithm. Time complexity for two approaches are n log(n).

Important Algorithms

optimal arrangement of jobs that certain deadlines must be completed to maximize profit or minimize loss

This repository serves as a valuable resource for individuals interested in exploring the design and analysis of algorithms. Whether you are a student studying computer science or a developer seeking to enhance your algorithmic skills, this collection will provide you with a diverse set of algorithms to learn from and apply in your projects.