Forward Mark Justification with airSlate SignNow

Forward signed justification

what's up everybody so today we're gonna go over a problem called text justification this is a problem asked at Google indeed Coursera Microsoft Amazon and a bunch of other top tech companies and it is of Hard difficulty I know a lot of you have been requesting more hard problems so moving forward I'm gonna be doing problems lying more on the medium to hard side however I still will be doing easy problems occasionally also before I get into the problem don't forget to sign up for my patreon if you want access to my private discord channel the link will be in the description so just as a warning this problem is very difficult and long so just be ready for that so our description says given an array of words and a width max width format the text such that each line has exactly max width characters and is fully left and right justified you should pack your words in a greedy approach that is pack as many words as you can in each line pad extra spaces when necessary so that each line has exactly max with characters extra spaces between words should be distributed as evenly as possible if the number of spaces on a line do not divide evenly between the words the empty slots on the left will be assigned more spaces than the slots on the right for the last line of text it should be left justified and no extra space is inserted between the words and then we have three notes that are very important it says a word is defined as a character sequence consisting of non space characters only each words length is guaranteed to be greater than zero and not exceed max width and finally the input array words contains at least one word okay so we're gonna go over an example we have a max width of 15 which means only 15 characters should fit on each line and then we have a words array which has what must be acknowledgment shall be so in order to solve this problem we need to know how many words can fit on each line so that it doesn't go over our max width so to do that we need to know all of the lengths of each word so the yellow numbers are the lengths of all of our words and then we have the output that worship to return from our function so in the first line we have what must be and as you can see there's those underlines those are the amount of spaces that we need between those words in order to make it justified correctly so the word what has four characters then we have three spaces the word must has four characters then we have two spaces and then the word B has two characters which all sums up to our max with the fifteen if we go to our second...