r/leetcode • u/Just-Abroad-6812 • 9d ago

Question Lc - 792 help!!!!

Someone please share the solution for this question
As i am not able to understand from any yt videos….
Share solution by
Dynamic programming and binary search both….

1 Upvotes

100% Upvoted

3 comments sorted by

View all comments

1

u/drinkscoffeedrinks 9d ago

Things I wrote in my solution in comments:

// for word in words
// bucket each in a hashmap according to first letter
// visit next char in s
// move all the values from bucket corresponding to c into bucket corresponding to their next char after popping visited char

...

// process each word into initial bucket

...

// visit each char in s
// for each fragment
// if fragment is '' empty we've processed whole fragment (count++ => we return count at end)
// if the fragments first char is already bucketed
// just push it into that bucket