Efficiently Merging Large Sorted Files
The solution involves using an external Merge sort algorithm for handling data that cannot fit into memory. We’ll use a two-pointer technique.
Tag: algorithm mathematics
Search a sorted 2D Matrix
This method has the limitation that it will work for only those matrix where the first integer of each row is greater than the last integer of the previous row.
Generate Pythagorean Triples
Given an integer limit, generate all Pythagorean Triples with values smaller than limit.
Sieve of Eratosthenes | HackerRank Solution
The sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking numbers in the range as composite by marking the multiples of each prime as non-prime.