Category: Data Structures & Algorithms

Join me to stay up-to-date and get my new articles delivered to your inbox by subscribing here.

Indexed Minimum Priority Queue - October 28, 2022

Motivation As stated here, a priority queue is an abstract data type similar to a regular queue or stack data structure in which each element additionally has a priority associated with it. The most common functions of priority queues are push and pop operations as same as regular queues. The time complexities of push and […]

Read more

Coding Interview Question: Find the greatest integer smaller than N with the same set of digits as N - October 20, 2022

Question Given an integer N, find the greatest integer less than N and has the same digits. If there is no such integer, return -1. For example: Input = 630 Output = 603 Input = 603 Output = 360 Input = 360 Output = 306 Input = 306 Output = -1 (Be careful, 063 could […]

Read more

Coding Interview Question: Nested List Weight Sum - October 15, 2022

Question Imagine an array that contains both integers and nested arrays, such as the following: [[2, [9, 1, 3], 8], 1, 4]. The depth sum is described as the weighted sum of each integer, weighted by their respective depths. In the example, 9’s depth is 3, while 8’s depth is 2, and 4’s depth is […]

Read more

Quick Select: Linear runtime complexity to find the median of unsorted arrays - October 12, 2022

Introduction I reviewed some implementations of the median function in widely used statistics packages. They use simple flow like sorting the array and returning the middle element.The average runtime complexity of comparison-based sorting algorithms is linearithmic -> O(N log N)And choosing the middle element is of constant runtime complexity -> O(1)So the runtime complexity of […]

Read more

1 2