Leetcode 818. Race Car (Python)

Показать описание

Leetcode 818. Race Car (Python)

In this video, I solve the Leetcode Race Car problem using Breadth First search (BFS). Very popular question with Google in panel coding interviews.

You can find code on my (Ravina Gaikawad) GitHub repository. Find the link below.

If you have any algorithm problems you want me to solve please let me know in the comments below.

Ravina Gaikawad
Pseudocoder

#codinginterview #algorithm #leetcode #python #programming #faang #dsa #youtubevideo #pseudocoder #codinginterview #algorithm #leetcode #python #programming #faang #dsa #youtubevideo #pseudocoderravina #education #job #jobapplication #jobsearch #interview #algo #datastructures #dsalgo #interviewquestions #interviewpreparation #easy #easytech #software #softwareengineer #heap #pythonprogramming #tree #binarytree #dfs #bfs #depthfirstsearch #breadthfirstsearch

Рекомендации по теме

Комментарии

How can you be sure 14:15 that is not better to continue in the wrong direction let's say for one more turn?

jaimeeduardo

how we can prove that we only need to make the reverse move when we are going away from the target.
How can we prove that being greedy will lead to an optimal solution?

deveshkumar

Ravina, You don't even need visited set :) .

codedoctor

While checking for reverse direction, Why we checking position + speed, isn't enough we only check position( < or > )target . Because positin is the actual state we are exploring.

sairam

Thank you for the video. Can you make the font bigger in future videos? It was hard to read.

schan

how to print instruction that if it is R or A i have written like this but i got wrong instruction kindly help me out where i am doing wrong
if(position == target):
print(currentInst)
return (moves, currentInst)
if(position, speed) in visited:
continue
else:
visited.add((position, speed))
currentInst+="A"
queue.append((moves+1, position+speed, speed*2, currentInst))

if(position +speed >target and speed >0) or (position +speed < target and speed < 0):
if(speed >0):
speed = -1

else :
speed = 1
currentInst+="R"
queue.append((moves+1, position, speed, currentInst))

taranjeetsingh-mkzs

Leetcode 818. Race Car (Python)

RACE CAR | LEETCODE # 818 | PYTHON BFS SOLUTION

Race Car | LeetCode 818 | BFS | Queue | Python Solution

Race Car - Leetcode 818 - BFS - Python

Leetcode 818. Race Car (Python)

LeetCode 818. Race Car - BFS - O( target * log(target) )

Leetcode 818 | Race Car | Under 3 minutes

Race Car: 818 - Google's most asked Dynamic Programming interview question - Microsoft, Amazon

Leetcode 818. Race Car (Python) - HINDI

LeetCode 818. Race Car

Leetcode 818. Race Car, Dijkstra's , BFS, Asked By Google 90 Times Past 6 Months

Leetcode 818

No Sound Leetcode 818: Race Car

818. Race Car (Leetcode Hard)

Race Car | Leetcode 818 | C++

Leetcode [818] Race Car

Race Car Leetcode

Leetcode Hard Question Series : 818. Race Car | Part - 01

818. Race Car | DP | Leetcode Hard

Leetcode 0818. Race Car

818. Race Car - Javascript

Car Pooling - Leetcode 1094 - Python

LeetCode 1094. [Medium] Car Pooling

Leetcode | 843. Guess the Word | Python

Detect Squares - Leetcode Weekly Contest - Problem 2013 - Python