Floyd-Warshall Algorithm Implementation | All pairs shortest path
Floyd-Warshall algorithm helps in finding the shortest path between all pairs of vertices in a graph.
Category: Algorithms
Binary Search Time Complexity Analysis
Since, at each step the size of the (searchable) array is reduced to half (1/2), we could write the following recurrence relation for the Binary Search Algorithm
Binary Search Explained | LeetCode Solution
Binary Search is a divide and conquer algorithm that finds a particular element within a sorted array or a given integer range.
Custom Comparators in C++
Custom Comparators are used to compare the members or objects of user-defined containers (class/data structure).
Minimum adjacent swaps required to sort Binary Array in O(n) | Amazon Interview Question
Given an array consisting of only 1s and 0s, sort this binary array such that all 0s are on the left and all 1s are on the right.
Tower of Hanoi | Recursion using Mathematical Induction
The Tower of Hanoi is a mathematical puzzle (game) consisting of three rods and a number of disks.
The objective of the puzzle is to move all the disks from the first rod (A) to the next rod (B) using the auxiliary rod (C).
Lucy and Flowers | HackerRank Solution [Medium]
The number of possible Binary Search Trees with n keys is Catalan Number (Cn). You could learn about Catalan Number & Binomial Coefficient.
Program for Nth Catalan Number
Catalan numbers (Cn) are a sequence of natural numbers. Nth Catalan number has applications in many counting problems.
How to calculate Binomial Coefficient (nCr) in O(r) time complexity
The recomputations in calculating binomial coefficient (nCr) can be avoided by exploiting optimal substructure and overlapping subproblems
Array Manipulation | HackerRank Solution [Hard]
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array.