반응형

algyrothm

    [LeetCode] 102. Binary Tree Level Order Traversal - Java
    알고리즘/LeetCode

    [LeetCode] 102. Binary Tree Level Order Traversal - Java

    https://leetcode.com/problems/binary-tree-level-order-traversal/ Binary Tree Level Order Traversal - LeetCode Binary Tree Level Order Traversal - Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: [https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg] Input: root = [ leetcode.com 문제 Given the root of ..

    알고리즘/LeetCode

    [LeetCode] 213. House Robber II - Java

    https://leetcode.com/problems/house-robber-ii/description/ 문제 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police ..

    알고리즘/LeetCode

    [LeetCode] 139. Word Break -Java

    https://leetcode.com/problems/word-break/description/ Word Break - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 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 ..

    알고리즘/LeetCode

    [LeetCode] 198. House Robber - Java

    https://leetcode.com/problems/house-robber/description/ House Robber - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob..

반응형

티스토리툴바