Leetcode 2000: Reverse Prefix of Word

🥷 1:1 coding interviews and leetcode problems coaching, Book a session with me on Superpeer: superpeer.com/algorithmscasts
🐮 Support the channel on Patreon: / algorithmspractice
Problem: leetcode.com/problems/reverse...
#leetcode #python #leetcodedailychallenge #leetcodedaily #algorithm #codinginterview #googleinterview
⭐ ⭐ MEDUIM LEETCODE PROBLEMS EXPLANATIONS: • Leetcode 2375. Constru...
⭐ ⭐ ⭐ HARD LEETCODE PROBLEMS EXPLANATIONS: • Google Interview Codin...
▬▬▬▬▬▬▬▬▬▬▬▬
leetcode weekly contest, weekly contest, leetcode, google coding interview, Leetcode 2000, leetcode 2000, Leetcode 2000. Reverse Prefix of Word,
Leetcode 2000. Reverse Prefix of Word, Reverse Prefix of Word
, biweekly contest, weekly contest, daily leetcode challenge, neetcode, neetcodeio, larry, bit manipulation, binary, xor operation, breadth first search, bfs, recursion, mathtwo pointers, string, binary manipulation, bit manipulation, binary, recursion, dynamic programming, kmp, prefix, string, prefix, suffix, brute force, matrix,geometry, brute force, prefix sum, hashmap brute force, sliding window, mean heap, geapq,

[@juanmacias5922]

I used a deque, and appended left until found, then regular append :D returned word if not found.

[@mdyusufansari8897]

this so diifcult,