max-heap-priority-queue

An optimised 🚀 implementation of Data structures & Algorithms like Fenwick Trees, Segment Trees, Stacks, Priority Queues, Linked Lists etc for enterprise usage in our favourite ❤️ language - JavaScript

Application for managing transactions among friends and simplify it similar to split-wise using max-heaps (priority_queue in c++)

Max Heap implementation in C++ using dynamic arrays.

The project is a network model of priority based packet routing implemented using the priority queue using max heap data structure. The project mimics packet routing, by receiving network packets (file handling concept) and re-transmitting the packets based on network priority.

Java implementation of Max Heap Priority Queue

Let's go DeepDiving 🤿

Have a warehouse that is made up of an array of sector objects, with each sector represented by a min binary priority queue based on the last day the products were purchased. Implemented a method that adds products into its proper sector which is dependent on their id, a restock/purchase method that increases/decreases the number of items

Optimize waste collection to prevent soil contamination (protecting the dry lake bed) and minimize fuel consumption on steep mountain roads.

This a bike-rental system aimed to leverage the gross profit for the company.

Assignment 3 in course Data Structures

Midterm homework of the Design and analysis of algorithm course

An advanced packet router simulator made to simulate a real router's routing stages. I had to learn Networking and Subnets for this project so it was really interesting.