392. Is Subsequence

linlaw Techblog

Make the change you want to see in the world.

392. Is Subsequence

Jun 22, 2021 | leetcode | Hits

Problem description:

Solution:

time complexity: $O()$
space complexity: $O()$
reference:
related problem:

easy medium hard

576. Out of Boundary Paths 792. Number of Matching Subsequences

Reading
STL
algorithm
behavioral question
- amazon
google
leetcode
microsoft
note
programming language
- study
project
study
- programming language
tutorial

adobe facebook leetcode easy hard string dynamic programming backtracking facebook microsoft google apple medium sliding window easy medium hard binary search bfs stack amazon dp array dfs two pointers hash table sorting greedy BFS union find uber design pure storage graph math linked list citrix sort merge sort two pointer linkedin bloomberg yelp heap trie binary seach topological sort adobe airbnb binary search tree divide and conquer lyft recursion Floyd's Tortoise and Hare Algorithm epic system binary indexed tree permutation brainteaser bit manipulation bucket sort queue has table peak random tree oracle greddy doubly linked list recursive String two sigma prefix sum paypal DFS ebay partition subset twitter east indeed game theory map snapchat interview STL C++ 11 MSDN double linked list BST java spring cycle detection algorithm space complexity economics Tree tree traversal preorder inorder postorder binary tree blockchain c++

1525.Number of Good Ways to Split a String
1423.Maximum Points You Can Obtain from Cards
1293.Shortest Path in a Grid with Obstacles Elimination
1197.Minimum Knight Moves
735.Asteroid Collision
443.String Compression
724.Find Pivot Index
934.Shortest Bridge
1048.Longest String Chain
1559.Detect Cycles in 2D Grid

linlaw's Linkedin

linlaw's Github

Copyright © 2021 linlaw Techblog. Powered by Hexo.