Datastructures examples: single- anddouble-linked lists, hash list, binary search tree.

C++26 powered GPU-accelerated scientific apps

You have N elements array but you are given that there are only K distinct values which have been repeated again and again in any order. For example N could be 1000 and K could be 10 means that the array contains only 10 values which are being duplicated anywhere in the array. Now you want to sort that array. You must have to give appropriate im…

Generic implementation of Segment Tree

Developed console based "Train Reservation System" using data structure

Professional C++17 code based on software practices and new methodologies from expert programmers

Nathan's DMOJ Problem Submissions

This repository provides a circular buffer implementation of a queue and iterable circular buffer class. The performance of the presented implementation is similar to that of the STL version.

C++ OOP labs

STL examples for competitive programming.

Testing parallel mode/extension of g++

Diferent files for Course C++ begineer

STL has the vast uses. This repo will contain all of the executions.

Blockchain implementation: Mining (POW), Serialization, Transactions and sign them, Merkle Tree

In this project, you will implement the various container types of the C++ standard template library. For each container, turn in the appropriately named class files. The namespace will always be ft and your containers will be tested using ft::<container>. You need to respect the structure of the reference container. If it’s missing a part of th…

Converts 3ds stl file(ascii format) into csv(comma seperated values)

Reimplementation of the STL containers (C++98 compatible)

This repository serves as a comprehensive collection of workshops completed during my course in OOP345. Each workshop showcases my knowledge and problem-solving skills on various C++ topics.

Repository contains C Programs, C++ Programs from difficulty level beginning to advanced. It also contains Modern C++ version 11, 14 and 17 programs.