fix

Author: Utkarsh1504

lessons/countsort.md

@@ -5,7 +5,6 @@ order: "5F"
 section: "Searching & Sorting"
 description: "learn Sorting algorithms"
 ---
-__________________________________________________________________________________________________________________
 
 Counting sort is a sorting algorithm that sorts the elements of an array by counting the number of occurrences of each unique element in the array. In Counting sort, we maintain an auxiliary array which drastically increases space requirement for the algorithm implementation.
 
@@ -160,4 +159,4 @@ The space complexity of Counting Sort is O(max). Larger the range of elements, l
 
 1. Shil and Birthday Present : https://www.hackerearth.com/problem/algorithm/shil-and-birthday-present/
 2. Finding Pairs : https://www.hackerearth.com/problem/algorithm/finding-pairs-4/
-3. Counting Sort : https://practice.geeksforgeeks.org/problems/counting-sort/1
+3. Counting Sort : https://practice.geeksforgeeks.org/problems/counting-sort/1