This is a walkthrough of my solutions to exercises in CP-Core-Skills course offered by StPetersburg University, Russia.
-
Updated
Jul 19, 2020 - Java
This is a walkthrough of my solutions to exercises in CP-Core-Skills course offered by StPetersburg University, Russia.
🔢 N-Puzzle solver built up on A* (with modifications), Greedy and Uniform Cost search algorithms. Available Heuristics are one of Manhattan, Hamming and Euclidean
Peak finder greedy and divide and conquer algorithms for 2D array, written in java.
🤖 Bot developed for the 2021 Entelect Challenge - Galaxio
My original solutions to all of LeetCode Blind 75 Problems
Classical Algorithm and Data Structure Problems
Data and Code for Article
The first homework of the subject Algorithms Design.
Algorithms code in java.
Greedy Algorithm to find the maximum number of mutually compatible jobs
Everything I need to know to get the better job.
Path Finder using Artificial Intelligence (2016)
Problems solved on Leetcode
Explore a curated collection of diverse coding challenges, honing problem-solving skills in a structured and organized manner. Whether you're a fellow learner or an interested observer, join the journey of mastering DSA through practical problem-solving.
Personal repo of SUSTech course CS208 Algorithm Design
Add a description, image, and links to the greedy topic page so that developers can more easily learn about it.
To associate your repository with the greedy topic, visit your repo's landing page and select "manage topics."