added solution for Find Smallest Letter Greater Than Target in c++.

[Sidd2024]

Problem number:- 744
Leetcode linik:- https://leetcode.com/problems/find-smallest-letter-greater-than-target/
Difficulty level:- Easy
Time complexity:- O(log(n))
Tags:- binarySearch, array.

#261

Description

here we are given a sorted array , a target. This problem is very similar to "Ceiling/Floor of a number" problem. Note that numbers wrap around which changes only the case where we have to return false if target is not present in array and for this problem we can print the first element if desired target is not found.

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• ["a","b","c","d"]
• ["l","m","n"]

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!