Leetcode with dani
Ir al canal en Telegram
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
Mostrar más1 240
Suscriptores
-124 horas
-37 días
-1730 días
Archivo de publicaciones
1 240
Repost from N/a
🏆 LeetCode 490. The Maze (Premium) 🏆
There's a ball in a maze with:
- Empty spaces (
0) and walls (1).
The ball can roll in any direction:
- Up, down, left, or right 🌐
But here's the catch:
- It won't stop until it hits a wall! 🚧
- Once it stops, it can choose another direction to roll.
### Task 🎯
Given:
- An m x n maze
- The ball's starting position and a destination
Determine:
- Can the ball stop at the destination?
- If yes, return true. Otherwise, return false.
📝 Assumption: All borders of the maze are walls.
---
### Examples 🔍
Example 1:
Input:
maze = [
[0,0,1,0,0],
[0,0,0,0,0],
[0,0,0,1,0],
[1,1,0,1,1],
[0,0,0,0,0]
],
start = [0,4],
destination = [4,4]
Output: true
Explanation: One possible path: left ➡️ down ➡️ left ➡️ down ➡️ right ➡️ down ➡️ right 🎯
---
Example 2:
Input:
maze = [
[0,0,1,0,0],
[0,0,0,0,0],
[0,0,0,1,0],
[1,1,0,1,1],
[0,0,0,0,0]
],
start = [0,4],
destination = [3,2]
Output: false
Explanation: The ball can pass through the destination, but it cannot stop there. ❌
---
Example 3:
Input:
maze = [
[0,0,0,0,0],
[1,1,0,0,1],
[0,0,0,0,0],
[0,1,0,0,1],
[0,1,0,0,0]
],
start = [4,3],
destination = [0,1]
Output: false
---
### Constraints 📏
- Maze Dimensions: 1 ≤ m, n ≤ 100
- Cells contain only 0 (empty) or 1 (wall).
- Start and destination are in empty spaces and won’t initially overlap.
Can you solve it? 🤔05 nov 2024, 07:20
1 240
🌟 Join Our LeetCode VIP Channel! 🌟
Unlock your coding potential for just 50 Birr (or $0.50)! Gain exclusive access to premium LeetCode questions, detailed solutions, and a supportive community to help you ace your coding interviews.
Why join?
• Curated problems tailored for interview success
• Step-by-step solutions and tips
• Connect with fellow coders and share insights
Don't miss out on this opportunity to level up your skills! Join now!
05 nov 2024, 06:27
05 nov 2024, ~07:58
1 240
Repost from A2SV - Discussion
Hello fellow coders,
After a brief break, we've returned! Get ready for our fun weekly community coding contest happening every Saturday 🗓. It's your chance to compete with other awesome programmers, learn more about coding, and, most importantly, have a great time! 🥳
🏆 Contest Details:
📅 Date: November 2, 2024
⏰ Time: 6:00 PM
🔗 Link for Contest: Community Weekly Contest Return - Contest No 1
P.S. Remember to fill out this form to secure your spot for our upcoming community classes and lectures. It’s your golden ticket to enriching experiences you won’t want to miss. 📚✨
02 nov 2024, 08:11
1 240
bitget reward selazegaje mokrut just one click https://t.me/BitgetWallet_TGBot/BGW?startapp=sharetask-SPNPTCD7wpBmTF3 🎁❓ You’re invited to unlock a mystery gift! ❓🎁 First 1,000,000 only! Clicking this link guarantees your qualification. First come, first served, do not wait! Join me on Bitget Wallet Lite now!
28 oct 2024, 08:33
28 oct 2024, ~14:37
1 240
#Q21 #leet_codeQ1249 Medium title. Minimum Remove to Make Valid Parentheses
Given a string s of '(' , ')' and lowercase English characters.
Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.
Formally, a parentheses string is valid if and only if:
It is the empty string, contains only lowercase characters, or
It can be written as AB (A concatenated with B), where A and B are valid strings, or
It can be written as (A), where A is a valid string.
Example 1:
Input: s = "lee(t(c)o)de)"
Output: "lee(t(c)o)de"
Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
Example 2:
Input: s = "a)b(c)d"
Output: "ab(c)d"
Example 3:
Input: s = "))(("
Output: ""
Explanation: An empty string is also valid.
Constraints:
1 <= s.length <= 105
s[i] is either '(' , ')', or lowercase English letter.
21 oct 2024, 02:10
1 240
Selection sort
def selection_sort(arr):
n = len(arr)
for i in range(n - 1):
# Assume the current position holds
# the minimum element
min_idx = i
# Iterate through the unsorted portion
# to find the actual minimum
for j in range(i + 1, n):
if arr[j] < arr[min_idx]:
# Update min_idx if a smaller element is found
min_idx = j
# Move minimum element to its
# correct position
arr[i], arr[min_idx] = arr[min_idx], arr[i]18 oct 2024, 03:43
1 240
insertion sort
def insertionSort(arr):
for i in range(1, len(arr)):
key = arr[i]
j = i - 1
# Move elements of arr[0..i-1], that are
# greater than key, to one position ahead
# of their current position
while j >= 0 and key < arr[j]:
arr[j + 1] = arr[j]
j -= 1
arr[j + 1] = key18 oct 2024, 03:42
1 240
bubble sort
def bubbleSort(arr):
n = len(arr)
# Traverse through all array elements
for i in range(n):
swapped = False
# Last i elements are already in place
for j in range(0, n-i-1):
# Traverse the array from 0 to n-i-1
# Swap if the element found is greater
# than the next element
if arr[j] > arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]
swapped = True
if (swapped == False):
break18 oct 2024, 03:42
1 240
this question is asked by amazon in interviews frequently
https://leetcode.com/problems/the-kth-factor-of-n/?envType=study-plan-v2&envId=amazon-spring-23-high-frequency
18 oct 2024, 03:30
1 240
18 oct 2024, 03:27
18 oct 2024, ~03:30
