GM's blog
  • Categories
  • Tags
  • About

    Voyager

    Camera test engineer

    • Seoul, Republic of Korea
    • Email
    • GitHub
    • LinkedIn

    Leetcode 792 Number of Matching Subsequences

    less than 1 minute read

    On this page

    • Problem
    • Solutions
      • 1. Brute force (Time Limited Exceeded)
      • 2. Hashmap + sliding (Accepted)

    Problem

    Solutions

    1. Brute force (Time Limited Exceeded)

    2. Hashmap + sliding (Accepted)

    Tags: LeetCode 792

    Categories: Algorithms

    Updated: September 21, 2020

    Twitter Facebook LinkedIn
    Previous Next

    You May Also Enjoy

    study on 2020-09-25

    less than 1 minute read

    finished preparation of presentation material for the interview with NAMI

    study on 2020-09-24

    less than 1 minute read

    A distressed Birx questions how long she can remain in the White House task force, source say

    study on 2020-09-23

    less than 1 minute read

    BBC:UN General Assembly: US-China tensions flare over coronavirus

    Leetcode #1493 Longest Subarray of 1’s After Deleting One Element

    less than 1 minute read

    1. Brute force (Time Limited Error)

    • Feed
    © 2020 software engineer @ Metron Hong Kong Ltd. Powered by Jekyll & Minimal Mistakes.