Question 1

We have given a grid of size N*M having characters "#", "" and any english lower alphabet.

• "#" : Filled
• "" : Empty
• Any english alphabet letter

We are also given an string word.
We have to find if we can fit this word in grid either directly matching with english alphabet or using the empty space (by filing with matching characters).
Word should match exactly and any empty space should not be left before and after.
We can have word match from left to right and top to bottom only.

Example

#### ####
L_# ALA # ALA does not fit as we have one space left at the end
#X#_  #X#__

#### ####
L_# ALAN# ALAN fits
#X#_  #X#__

---

Optimizing Video Chunks for Streaming

You're optimizing video chunks for streaming. Each chunk has a size represented in a 0-indexed array nums. To ensure smooth playback, chunk sizes must be in non-decreasing order.

Split Operation Rules

You can split any chunk into two smaller chunks whose sizes add up to the original.

For example, if nums = [10, 5, 8], you can split 10 into [4, 6] making it [4, 6, 5, 8].

Objective

Return the minimum number of split operations needed to make the array sorted in non-decreasing order.

Notes

Was able to come up with and code O(n^2) solution within 15 mins.

He asked to improvise to O(n) which I couldn't.

我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。

We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.