#data-structures
Read more stories on Hashnode
Articles with this tag
Bit Magic · Let's look at some of the useful tactics of the Bitwise Operators Divide a number by 2 n=n>>1; Multiply a number by 2 n=n<<1; Count total...
Implementing stack using queue · A little introduction to Stack and Queue: Stacks – Support retrieval by last-in, first-out (LIFO) order. Stacks are...
Introduction to sorting · sorting-rearranging a collection of items into increasing or decreasing order-is a common problem in computing. Sorting is used...