Back To Module Home

0% completed

Algorithmic Paradigms

Brute Force Greedy Algorithms Divide and Conquer Dynamic Programming

Sorting and Searching

Selection Sort, Bubble Sort, and Insertion Sort Merge Sort Quick Sort Overview of Sorting Algorithms Searching Algorithms Challenge 1: Find Two Numbers that Add up to "n"Solution Review: Find Two Numbers that Add up to "n"Challenge 2: Search in a Rotated List Solution Review: Search in a Rotated List Challenge 4: Arrange a Binary List Solution Review: Arrange a Binary List Challenge 5: Find the Maximum Product of Two Integers in a List Solution Review: Find Maximum Product of Two Integers in a List Challenge 6: Find Duplicates in a List with No Repetition Solution Review: Find Duplicates in a List with No Repetition Challenge 7: Search in a 2D List Solution Review: Search in a 2D List Challenge 8: Search Position Solution Review: Search Position Challenge 9: Dutch National Flag Problem Solution Review: Dutch National Flag Problem Quiz on Sorting & Searching

Graph Algorithms

Introduction to Graph Algorithms and Implementation Challenge 1: Implement Breadth-First Graph Traversal Solution Review: Breadth-First Graph Traversal Challenge 2: Implement Depth-First Graph Traversal Solution Review: Depth-First Graph Traversal Challenge 3: Calculate the Number of Nodes in a Graph Level Solution Review: Calculate the Number of Nodes in a Graph Level Challenge 4: Transpose a Graph Solution Review: Transpose a Graph Challenge 5: Find all Paths between Two Nodes Solution Review: Find all Paths between Two Nodes Challenge 6: Check if a Graph is Strongly Connected Solution Review: Check if a Graph is Strongly Connected Challenge 7: Find All Connected Components in a Graph Solution Review: Find All Connected Components of a Graph Challenge 8: Remove an Edge Solution Review: Remove an Edge Challenge 9: Detect a Cycle in a Graph Solution Review: Detect a Cycle in a Graph Quiz on Graph Algorithms

Greedy Algorithms

Greedy Approach: A Deep Dive Challenge 1: Counting Money!Solution Review: Counting Money Challenge 2: Connecting n Pipes with Minimum Cost Solution Review: Connecting n Pipes with Minimum Cost Challenge 3: Find the Egyptian Fraction's Denominators Solution Review: Find the Egyptian Fraction Challenge 4: Find the Minimum Platforms Required for a Station Solution Review: Find Minimum Platforms Required for a Station Challenge 5: Find the Largest Number Possible Solution Review: Find the Largest Number Possible Quiz on Greedy Algorithms

Dynamic Programming

Calculating Fibonacci Numbers Introducing Dynamic Programming with Fibonacci Numbers Memoizing Fibonacci Numbers Tabulating Fibonacci Numbers Challenge 1: The 0/1 Knapsack Problem Solution Review: The 0/1 Knapsack Problem Challenge 4: Longest Common Substring Solution Review: Longest Common Substring Challenge 5: Shortest Common Supersequence(SCS)Solution Review: Shortest Common Supersequence(SCS)Challenge 6: Longest Palindromic Subsequence Solution Review: Longest Palindromic Subsequence Challenge 7: The Coin Change Problem Solution Review: The Coin Change Problem Challenge 8: Egg Dropping Problem Solution Review: Egg Dropping Problem Challenge 9: Strings Interleaving Solution Review: Strings Interleaving Challenge 10: Edit Distance Problem Solution Review: The Edit Distance Problem Quiz on Dynamic Programming

Divide and Conquer

Introduction to Divide and Conquer With Binary Search

Pascal's Triangle

Challenge 1: Euclidean Algorithm

Solution Review: Euclidean Algorithm

Challenge 2: Find the Peak Element

Solution Review: Find the Peak Element

Challenge 4: Collect Coins in Minimum Steps

Solution Review: Collect Coins in Minimum Steps

Challenge 5: Find the Floor and Ceil of a Number in a Sorted List

Solution Review: Find Floor and Ceil of a Number in a Sorted List

Challenge 6: Missing Number in a Sorted List

Solution Review: Missing Number in a Sorted List

Challenge 7: Find the Closest Number

Solution Review: Find the Closest Number

Challenge 8: Shuffle Integers

Solution Review: Shuffle Integers

Challenge 9: Inversion Count in a List

Solution Review: Inversion Count in a List

Quiz on Divide and Conquer

Conclusion

...

/

Challenge 7: Find the Closest Number

Challenge 7: Find the Closest Number

In this lesson, we will solve a challenge on finding the closest number to a given number in a list.

Closest number

In any given sorted list, the closest number to a given number is the one whose absolute difference with the given number is closest to zero.

Have a look at the following illustration for a better ...