topics

Introduction Sometimes we need to infer algorithms by time complexity. After we bring out the brute force solution, the interviewer […]

Introduction Binary search is a very popular algorithm for finding a target element in a sorted array. Algorithm Here’s a

Introduction Recursion is a common topic during coding interview. This post talks about how to succesfully write a correct recursion

Introduction Quick select is an algorithm used to quickly locate the Kth largest/smallest element in an array. Technically speaking, it’s

Introduction Both merge sort and quick sort are popular sorting algorithms. They both use recursion and leverage devide and conquer

Introduction Merge sort is another popular algorithm, with time complexity as O(nlogn). It’s leveraging the principle of divide and conquer,

Introduction Quick sort is one of the most popular algorithms for sorting. It’s not uncommon to see this algorithm or

Prefix sum is a very useful technique which can be used for some subarray questions. Let’s look at how it