Common problems of dynamic programming methods and techniques, including prerequisites, for competitive programmers.

DSA in java

Implementations of Fundamental Algorithms & Data Structures in C++.

Google Hashcode 2020 Online Qualification Round. 388 place of 10724

Leetcode, Leetcode Solutions, Competitive Programming, Algodesign

Gravity Model NLP via Greedy Solution Space Search

Greedy Algorithm Implementation In Solving The Knapsack Problem Case to Maximum Profit

In this project, I have developed a topographic path planner designed for surveillance drones navigating through challenging terrains. The objective is to find the most cost-efficient path between two given coordinates while considering the elevation data of the geographical area.

This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.