Leetcode with dani
Kanalga Telegram’da o‘tish
Join us and let's tackle leet code questions together: improve your problem-solving skills Preparing for coding interviews learning new algorithms and data structures connect with other coding enthusiasts
Ko'proq ko'rsatish1 240
Obunachilar
-124 soatlar
-37 kun
-1730 kun
Postlar arxiv
1 240
441. Arranging Coins #binary_search #Easy #leet_code_Q8 #441
You have n coins and you want to build a staircase with these coins. The staircase consists of k rows where the ith row has exactly i coins. The last row of the staircase may be incomplete.
Given the integer n, return the number of complete rows of the staircase you will build.
01 Iyun 2024, 02:12
1 240
How to be a creative thinker | Carnegie Mellon University Po-Shen Loh
01 Iyun 2024, 02:07
1 240
Answer:
class Solution: def peakIndexInMountainArray(self, arr: List[int]) -> int: left = 0 right = len(arr)-1 while(left<=right): mid = (left+right)//2 if arr[mid] > arr[mid-1] and arr[mid] > arr[mid+1]: return mid elif arr[mid] > arr[mid+1]: right = mid -1 else: left = mid +1
31 May 2024, 02:26
1 240
Here's a common approach to find the peak index in a mountain array:
1 We can use a binary search algorithm.
2 Start with the middle element of the array.
3 If the middle element is greater than its right neighbor, then the peak must be in the left half of the array. Move to the left half and go to step 2 .
4 If the middle element is less than its left neighbor, then the peak must be in the right half of the array. Move to the right half and go to step 2.
5 If the middle element is greater than both its neighbors, then it's the peak!
31 May 2024, 02:17
1 240
Let's solve the peak index problem in mountain arrays. A peak index in a mountain array refers to the index i where:
Elements to the left of index i are strictly increasing: arr[0] < arr[1] < ... < arr[i-1].
Elements to the right of index i are strictly decreasing: arr[i] > arr[i+1] > ... > arr[arr.length - 1].
In simpler terms, the element at the peak index is the largest element in the array, with elements increasing to its left and decreasing to its right.
31 May 2024, 02:15
1 240
Did you solve the peak mountain array problem?
30 May 2024, 13:10
1 240
Constraints:
3 <= arr.length <= 105
0 <= arr[i] <= 106
arr is guaranteed to be a mountain array.
30 May 2024, 02:47
1 240
Example 1:
Input: arr = [0,1,0]
Output: 1
Example 2:
Input: arr = [0,2,1,0]
Output: 1
Example 3:
Input: arr = [0,10,5,2]
Output: 1
30 May 2024, 02:46
1 240
#binary_search #Medium #leet_code_Q7 852. Peak Index in a Mountain Array
An array arr is 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] > ... > arr[arr.length - 1]
Given a mountain array arr, return the index i such that arr[0] < arr[1] < ... < arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1].
You must solve it in O(log(arr.length)) time complexity.
30 May 2024, 02:46
1 240
https://t.me/hAmster_kombat_bot/start?startapp=kentId1379272048
Play with me, become cryptoexchange CEO and get a token airdrop!
💸 2k Coins as a first-time gift
🔥 25k Coins if you have Telegram Premium
28 May 2024, 04:51
29 May 2024, ~11:46
1 240
የማብድ ቢመስለኝ ፣ ድንገት አንቺን ሳጣ አረቄ ቤት ሔጄ ፣ አረቄ ስጠጣ አንድ ግጥም ሰማሁ ፍቅርሽን ከልቤ ፣ ነቅሎ የሚያወጣ፡፡ ያውም መንገድ በሚል... ለመንገደኛ ሰው ፣ ሰካራም የፃፈው እዛ ጋ ቁጭ ብሎ... "ከዳችኝ" እያለ ፣ የሚለፈልፈው መንገድ የሚል ግጥሙ ፣ጆሮዬን ገረፈው፡፡ ጆሮዬ ሲገረፍ ፣ ጠባሳ ጣለብኝ ፣ ግጥሙን እንዳልረሳ "መንገድ አያደርስም መንገድ አይመልስም ፣ እግር ካልተነሳ!!!" እያለ ይገጥማል... ደጋግሞ ደጋግሞ ፣ ሌላ አይናገርም እሱም ልክ እንደኔ ... አንዷን በመሔዷ ፣ ሳያጣት አይቀርም፡፡ ብቻ ሰክሪያለሁ ለመንገደኛ ሴት ፣ የተፃፈ ግጥምን ፣ ጆሮዬ ያደሞጣል መሔድሽን ያየ እንደሌሌሽኝ ሲያውቅ ፣ ሊኖረኝ ይመጣል ይህ ነው መንገድ ማለት! የሰካራም ግጥምን ሰክሬ ስረዳው ማፍቀረ ሳይሆን ለኔ ፣ መርሳት ነው ሚጎዳው!!!ሰለወደድኩት ነው
25 May 2024, 04:01
1 240
answer:
class Solution: def nextGreatestLetter(self, letters: List[str], target: str) -> str: left = 0 right = len(letters)-1 while(left<=right): mid = (left+right)//2 if(letters[mid] > target )and (letters[mid-1] <= target or mid==left): return letters[mid] elif letters[mid] > target: right = mid -1 else: left = mid +1 return letters[0]
24 May 2024, 01:54
1 240
Constraints:
2 <= letters.length <= 104
letters[i] is a lowercase English letter.
letters is sorted in non-decreasing order.
letters contains at least two different characters.
target is a lowercase English letter.
23 May 2024, 12:34
