data structure Interval Trees: One step beyond BST Interval tree is a variant of BST and is able to handle intervals in logarithmic time for search, insert and delete operations and is used in geometry.
data structure Sparse Table Sparse table is a data structure which pre-process the information to answer static Range Queries in constant time O(1) with O(N log N) preprocessing.
software engineering Getting started with 2D graphics in C++ (SDL2) We will start by implementing a basic class design which initialize various parameters of SDL with a clear black window. From there, we will implement drawing different shapes and then we will create a simple animation
