Will the Guru

Category: Algorithm

  • 시간 복잡도와 메모리

    시간 복잡도 메모리 입출력

  • Group Anagrams

    Problem https://leetcode.com/problems/group-anagrams/description/ Solution #1 Solution #2 Better Solution

  • Daily Temperatures

    Problem https://leetcode.com/problems/daily-temperatures/ Solution

  • Generate Parentheses

    Problem https://leetcode.com/problems/generate-parentheses/ Solution

  • Number of Islands

    Problem https://leetcode.com/explore/learn/card/queue-stack/231/practical-application-queue/1374/ Solution

  • Walls and Gates

    Problem https://leetcode.com/explore/learn/card/queue-stack/231/practical-application-queue/1373/ Solution

  • Evaluate Reverse Polish Notation

    Problem https://leetcode.com/problems/evaluate-reverse-polish-notation/ Solution

  • Moving Average from Data Stream

    Problem Solution Queue를 쓰는 것 뿐만 아니라, Deque를 사용해서 구현 가능했다.

  • Longest Increasing Subsequence

    Longest Increasing Subsequence

    Longest Increasing Subsequence(LIS) is one of the most common problems of dynamic programming. Longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible For example, when we have…

  • (KOR) 설탕 배달

    Problem – ⭐️⭐️⭐️⭐️ https://www.acmicpc.net/problem/2839 Solution Key Points 쉬운듯 어려웠던 문제. 그리디 알고리즘의 기본적인 문제로, 5를 기준으로 연산해주는 것이 포인트.