How the bits/stdc++ .h works in C++
I often wonder, How does #include < bits/stdc++.h> work?. I’ve seen this while solving competitive problems and referring to various solutions and I wanted to know what’s happing in the…
Optimized
Separate 0s and 1s – O(N) Single Iteration
Given an array of numbers consisting of only zeroes and ones, and we need to separate 0s and 1s. This problem can be solved in many ways like sorting and…
Count the Duplicates of Array O(N)
In the given problem, we have a sorted array, and we need to count the duplicates of each element. In simple words, we should print the no.of times each element…
Target Sum – Single Iteration O(N)
Given, a sorted array of elements and we need to find all the pairs of elements that add up equally to a given target sum number, this can be done…
Fibonacci Series – Iterative vs Recursive
The Fibonacci Series is a standard programming problem scenario, and we can obtain the series or nth Fibonacci number using both iterative as well as recursive. In this post, we’ll…
Bubble Sort Algorithm
Bubble sort is one of the simple sorting techniques and it is also easier to code and understand. Bubble sort follows the simple principle of comparing two adjacent elements and…