Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Find Smallest Letter Greater Than Target Binary Search LeetCode](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Find-Smallest-Letter-Greater-Than-Target-Binary-Search-LeetCode.png "[Solved] Find Smallest Letter Greater Than Target Binary Search LeetCode")
Find Smallest Letter Greater Than Target Binary Search: Given a characters array letters that is sorted in non-decreasing order and a character target, return the smallest character in the array that is larger than target. Note that the letters wrap around. For example, if target == ‘z’ and letters == [‘a’,…
![[Solved] Search In Rotated Sorted Array Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Search-In-Rotated-Sorted-Array-Problem.png "[Solved] Search In Rotated Sorted Array Problem")
Search In Rotated Sorted Array: You have been given a sorted array/list ARR consisting of ‘N’ elements. You are also given an integer ‘K’. Now the array is rotated at some pivot point unknown to you. For example, if ARR…
Search In Rotated Sorted Array: Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1,…
![[Solved] First and Last Position of an Element In Sorted Array](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-First-and-Last-Position-of-an-Element-In-Sorted-Array.png "[Solved] First and Last Position of an Element In Sorted Array")
First and Last Position of an Element In Sorted Array: You have been given a sorted array/list ARR consisting of ‘N’ elements. You are also given an integer ‘K’. Now, your task is to find the first and last occurrence…
![[Solved] Peak Index in a Mountain Array LeetCode Problem in Java](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Peak-Index-in-a-Mountain-Array-LeetCode-Problem-in-Java.png "[Solved] Peak Index in a Mountain Array LeetCode Problem in Java")
Peak Index in a Mountain Array: Let’s call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length – 1 such that: arr[0] < arr[1] < … arr[i-1] < arr[i] arr[i] > arr[i+1] > … >…