Contains some useful custom Data-Structures/Containers & Algorithms, developed during my 3rd semester at University.

A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.

C++ code for "A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque"

Topic Wise Implementation, Details and Questions based on Data Structures and Algorithms

📚Everything you will EVER need to survive Data Structures, in C++. In collaboration with @PreethiSamanthaBennet✨

A faster method for singular erasures, ranged erasures, and erase_if-style erasures for vector/deque/static_vector when element order is not important.

a rough imitation of @stl

A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.

Thread-safe unordered container, with thread-safe elements access/mutation, std::vector iteration speed and stable iterators

C and C++ data structures and algorithms completed outside of my university classes

Mini Thread is a library for creating secure threads for the esp32 microcontroller. With variable condition support if required. And wrappers and many usefull wrappers

Best collection of Data Structures and Algorithms (Includes basic, advance & augmented data structures).

C++11, STL-like API, bidirectional iterator, min, max, median, one memory allocation in the circular buffer.

Solving Codeforces Problems

C++ implementation of various data structures.

A C++ header only library containing a cyclic deque, aka a circular buffer, that supports fast insertion and deletion at both its beginning and end.

Reusable double-ended queue iterable container implemented as a circular array.

SDE Interview Preparation

A simple fixed-size deque implementation in C.

This repository contains solutions of assignments of DSA through C++ MySirG