Super Easy FAANG Interview Question! Is Subsequence - Leetcode 392

dynamic programming, leetcode, coding interview question, data structures, data structures and algorithms, faang

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@polyjackets8659]

its statistically easier to get accepted to Harvard than to get hired by google

[@priyanshuganatra]

Lol it's depressing how tough it's to get a tech job in a good company nowadays

[@erek]

number of tech companies better than google is greater than the number of ivy leagues

[@anti-tankartur677]

Google?? Try any tech jobs rn

[@meloviiii]

Yeah tbf the number of great companies are countless, compared to number of ivy leagues​@@erek

[@dawsonwmnm]

BRO IS ON TO NOTHING🔥🗣

[@mrchrunchasmr]

always come across your videos but never subscribed but it was consistently too good to not subscribe so you erned a subscriber keep doing amazing bro im a content creator myself and i can see the effort you put into these videos

[@SajjadAhmed-lc2dr]

best series

[@codingparas]

Great videos.

[@mrchrunchasmr]

amazing vids

[@target500milliontradersinv5]

Bro, Pls update these problems in google sheet, so it would great and helpful

[@tomaszeq75]

recursion version
t = 'abcde'
s = 'acd'
def is_subsequence_rec(s: str, t: str) -> bool:
if s[0] in t:
if len(s) == 1: return True
return is_subsequence_rec(s[1:], t[t.index(s[0]) + 1:])
else: return False
print(is_subsequence_rec(s, t))

[@davidespinosa1910]

In Python, two problems:
(1) The recursion limit is 1000.
(2) s[1:] isn't pointer arithmetic -- it actually copies s.

[@nabilfannane7217]

Javascript
let s='abc'
let t='ahgbc'
let final=''
for (let i=0;ival===s[i] ? final+=val:null)
}
console.log(final=== s)

[@Akisame-LuigI-O]

if you're using python wouldn't it be faster to use regex or is that not allowed here?

[@davidespinosa1910]

Generally not allowed. But good idea, how would you write it using a regex ?

[@Akisame-LuigI-O]

@@davidespinosa1910 ".*".join(s). That's your regex prompt

[@AbhishekSharma-ex7rx]

Why are you mostly explaining most asked easy question just to pull out most of the audience you should explain medium questions BCS it is the truth that they are asked more then easy ones.

[@eshvarbalaji3950]

Say is it 1) A B C
2)BAC then will A get missed out?

[@robertomachin8914]

Agreed, but I guess you cam just sort them beforehand to make sure its in alphabetical order

[@basharal-ghada3242]

I think your logic is a bit flawed, what if there are 2 A's , like aghabjkabc
This won't work

[@codingparas]

It works. It's a subsequence not a substring.

[@basharal-ghada3242]

@@codingparas thanks for clarifying, my bad 😅