Given n appointments, find all conflicting appointments

Author: sachuverma

DSA Crack Sheet/README.md

@@ -25,7 +25,7 @@
 - [Factorials of large numbers](https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0# "view question") - [Cpp Solution](./solutions/Factorials%20of%20large%20numbers.cpp)
 - [Maximum Product Subarray](https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1 "view question") - [Cpp Solution](./solutions/Maximum%20Product%20Subarray.cpp)
 - [Longest consecutive subsequence](https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence2449/1# "view question") - [Cpp Solution](./solutions/Longest%20consecutive%20subsequence.cpp)
-- [Given an array of size n and a number k, find all elements that appear more than n/k times "view post"](https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/)
+- [Given an array of size n and a number k, find all elements that appear more than n/k times](https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/ "view post")
 - [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/ "view question") - [Cpp Solution](./solutions/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.cpp)
 - [Array Subset of another array](https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0 "view question") - [Cpp Solution](./solutions/Array%20Subset%20of%20another%20array.cpp)
 - [Triplet Sum in Array](https://practice.geeksforgeeks.org/problems/triplet-sum-in-array-1587115621/1# "view question") - [Cpp Solution](./solutions/Triplet%20Sum%20in%20Array.cpp)
@@ -218,7 +218,7 @@
 - [Find median of BST in O(n) time and O(1) space](https://www.geeksforgeeks.org/find-median-bst-time-o1-space/ "view post")
 - [Count BST nodes that lie in a given range](https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1# "view question") - [Cpp Solution](./solutions/Count%20BST%20nodes%20that%20lie%20in%20a%20given%20range.cpp)
 - [Replace every element with the least greater element on its right](https://www.geeksforgeeks.org/replace-every-element-with-the-least-greater-element-on-its-right/ "view question")
-- []( "view question") - [Cpp Solution](./solutions/.cpp)
+- [Given n appointments, find all conflicting appointments](https://www.geeksforgeeks.org/given-n-appointments-find-conflicting-appointments/ "view post")
 - [Preorder to BST](https://practice.geeksforgeeks.org/problems/preorder-to-postorder4423/1# "view question") - [Cpp Solution](./solutions/Preorder%20to%20BST.cpp)
 - [Check whether BST contains Dead End](https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1 "view question") - [Cpp Solution](./solutions/Check%20whether%20BST%20contains%20Dead%20End.cpp)
 - [Flatten BST to sorted list](https://www.geeksforgeeks.org/flatten-bst-to-sorted-list-increasing-order/ "view post")