Greedy Algorithm to minimize lateness when scheduling jobs on a processor

🔢 N-Puzzle solver built up on A* (with modifications), Greedy and Uniform Cost search algorithms. Available Heuristics are one of Manhattan, Hamming and Euclidean

https://useful-journey-3db.notion.site/435-Non-overlapping-Intervals-b07abf8f4f00494c9656b1964e6f0a4b

This is a walkthrough of my solutions to exercises in CP-Core-Skills course offered by StPetersburg University, Russia.

https://useful-journey-3db.notion.site/678-Valid-Parenthesis-String-817f1b42addb405989b143b81c55fc6e

https://useful-journey-3db.notion.site/919-Meeting-Rooms-II-7e043aa1d7dc4ddd866cb3d44ff19bc4

Implementation of basic algorithms in Java.

Utilization of Greedy algorithm in Entellect Challenge 2019 “Worms”.

🤖 Bot developed for the 2021 Entelect Challenge - Galaxio

My original solutions to all of LeetCode Blind 75 Problems

Data and Code for Article

The first homework of the subject Algorithms Design.

Algorithms code in java.

https://useful-journey-3db.notion.site/1899-Merge-Triplets-to-Form-Target-Triplet-da6b6e567af649248193c222f683461b

A comparison of implementation of Codeforces' problem 489C using Dynamic Programming and Greedy

There is a robot for a library.A sample input file is given below. The first 10 rows represent the adjacency matrix. Then, each room’s name is followed by weight and number of pages of books in 5 rooms. Knapsack algorithm is for maximaxing the total number of pages (it can pick total of 5 kilograms of books from 5 rooms )and Prim algorithm is used.

Stable matching, dynamic programming for now

Java implementation of various algorithms.

📖 Studying algorithms with JAVA