꾸준함이 실력입니다.

• LeetCode : 665. Non-decreasing Array

  2023-01-22

  goodGid

  LeetCode
  • 665. Non-decreasing Array
    • Problem

  665. Non-decreasing Array

  Problem

  Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element.
  We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2).
  

  Read All

  ---

• LeetCode : 1220. Count Vowels Permutation

  2023-01-22

  goodGid

  LeetCode
  • 1220. Count Vowels Permutation
    • Problem

  1220. Count Vowels Permutation

  Problem

  Given an integer n, your task is to count how many strings of length n can be formed under the following rules:
  
  Each character is a lower case vowel ('a', 'e', 'i', 'o', 'u')
  Each vowel 'a' may only be followed by an 'e'.
  Each vowel 'e' may only be followed by an 'a' or an 'i'.
  Each vowel 'i' may not be followed by another 'i'.
  Each vowel 'o' may only be followed by an 'i' or a 'u'.
  Each vowel 'u' may only be followed by an 'a'.
  Since the answer may be too large, return it modulo 10^9 + 7.
  

  Read All

  ---

• LeetCode : 1383. Maximum Performance of a Team

  2023-01-15

  goodGid

  LeetCode
  • 1383. Maximum Performance of a Team
    • Problem

  1383. Maximum Performance of a Team

  Problem

  You are given two integers n and k and two integer arrays speed and efficiency both of length n. There are n engineers numbered from 1 to n. speed[i] and efficiency[i] represent the speed and efficiency of the ith engineer respectively.
  Choose at most k different engineers out of the n engineers to form a team with the maximum performance.
  The performance of a team is the sum of their engineers' speeds multiplied by the minimum efficiency among their engineers.
  Return the maximum performance of this team. Since the answer can be a huge number, return it modulo 109 + 7.
  

  Read All

  ---

• LeetCode : 606. Construct String from Binary Tree

  2023-01-12

  goodGid

  LeetCode
  • 606. Construct String from Binary Tree
    • Problem

  606. Construct String from Binary Tree

  Problem

  Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way, and return it.
  Omit all the empty parenthesis pairs that do not affect the one-to-one mapping relationship between the string and the original binary tree.
  

  Read All

  ---

• 2023 Dev History

  2023-01-01

  goodGid

  Retrospective

  2023년 Dev History

  • 2022 Dev History에 이어

  • 2023년에도 내가 어떤것에 관심을 갖고

    어떤 공부를 했고 그로 인해 어떤 성장을 했는지 기록해두자.

  Read All

  ---

• [네트워크] 0.0.0.0/0 과 ::/0는 뭐가 다른걸까?

  2022-09-19

  goodGid

  Network
  • Question

  Question

  

  • 0.0.0.0/0 과 ::/0 는 무슨 차이일까?
  Read All

  ---