LiDARism

https://leetcode.com/problems/word-break/description/?envType=problem-list-v2&envId=oizxjoit Word Break - LeetCodeCan you solve this real interview question? Word Break - Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the dictionary mayleetcode.com bottom-up DP로 풀..

https://leetcode.com/problems/container-with-most-water/submissions/1912411023/?envType=problem-list-v2&envId=oizxjoit Container With Most Water - LeetCodeCan you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lin..

https://leetcode.com/problems/clone-graph/?envType=problem-list-v2&envId=oizxjoit Clone Graph - LeetCodeCan you solve this real interview question? Clone Graph - Given a reference of a node in a connected [https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_graph] undirected graph. Return a deep copy [https://en.wikipedia.org/wiki/Object_copyleetcode.com Graph cloning은 DFS, BFS 등..

https://leetcode.com/problems/palindromic-substrings/description/?envType=problem-list-v2&envId=oizxjoit Palindromic Substrings - LeetCodeCan you solve this real interview question? Palindromic Substrings - Given a string s, return the number of palindromic substrings in it. A string is a palindrome when it reads the same backward as forward. A substring is a contiguous sequence of characterleet..

https://leetcode.com/problems/same-tree/description/?envType=problem-list-v2&envId=oizxjoit Same Tree - LeetCodeCan you solve this real interview question? Same Tree - Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have theleetcode.com 두 graph에 대해서 DFS를..

https://leetcode.com/problems/clone-graph/?envType=problem-list-v2&envId=oizxjoit 자료구조를 복사할 때는 DFS가 기본이다... 이젠 외워줘 제발 """# Definition for a Node.class Node: def __init__(self, val = 0, neighbors = None): self.val = val self.neighbors = neighbors if neighbors is not None else []"""from typing import Optionalclass Solution: def cloneGraph(self, node: Optional['Node']) -> Option..

All Paths From Source to Target - LeetCode DFS든 BFS든 상관 없고DFS는 할 거면 end state 아닐 때 pop하는 걸 기억해야하고,BFS는 그거랑 상관없이 path의 맨 뒤 node를 기준으로 해서 queueing하는 것 정도? ##### by DFSclass Solution: def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[int]]: n = len(graph) target = n - 1 res = [] path = [] def dfs(node): ## do smthing p..

https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/description/ DFS를 할 때 버리는 돌에 대한 합계를 수집해야한다는 것을 염두해두고 함수를 만들어야한다. class Solution: def removeStones(self, stones: List[List[int]]) -> int: n = len(stones) visited = [False] * n def dfs(idx): visited[idx] = True xi, yi = stones[idx] size = 1 for j in range(..

https://leetcode.com/problems/maximum-depth-of-binary-tree/description/ Maximize하라는 얘기가 나오면 그냥 DFS를 한다는 걸 기억해야해...! # Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def maxDepth(self, root: Optional[TreeNode]) -> int: if root is None..

https://leetcode.com/problems/cheapest-flights-within-k-stops/description/ Bellman-Ford로 푸는게 가장 간단하다고 한다?class Solution: def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, k: int) -> int: """Bellman-Ford""" INF = 10**15 dist = [INF] * n dist[src] = 0 for _ in range(k + 1): tmp = dist[:] # use snapshot fo..