# Coding Problems and Solutions-4

`Input: wood = [232, 124, 456], k = 7Output: 114Explanation: We can cut it into 7 pieces if any piece is 114 long, however we can't cut it into 7 pieces if any piece is 115 long.`
`Input: S = "loveleetcode", C = 'e'Output: [3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0]`
`Input: tasks = ["A","A","A","B","B","B"], n = 2Output: 8Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.`
1. insert(val) : Inserts an item val to the collection.
2. remove(val) : Removes an item val from the collection if present.
3. getRandom() : Returns a random element from current collection of elements. The probability of each element being returned is linearly related to the number of same value the collection contains.
• It is the empty string, contains only lowercase characters, or
• It can be written as AB (A concatenated with B), where A and B are valid strings, or
• It can be written as (A), where A is a valid string.
`Input: s = "lee(t(c)o)de)"Output: "lee(t(c)o)de"Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.`
`void addWord(word)bool search(word)`
`addWord("bad")addWord("dad")addWord("mad")search("pad") -> falsesearch("bad") -> truesearch(".ad") -> truesearch("b..") -> true`
`Input: target = 100, startFuel = 10, stations = [[10,60],[20,30],[30,30],[60,40]]Output: 2Explanation: We start with 10 liters of fuel.We drive to position 10, expending 10 liters of fuel.  We refuel from 0 liters to 60 liters of gas.Then, we drive from position 10 to position 60 (expending 50 liters of fuel),and refuel from 10 liters to 50 liters of gas.  We then drive to and reach the target.We made 2 refueling stops along the way, so we return 2.`
`Input:Dictionary: { hello, cat, world, dog, bird, grass, green, help, greet, great }String: bbbirrrddddOutput: TrueExplanation: The character's 'b', 'r', & 'd' all repeat. Assuming their keys got stuck, we can form the word 'bird', which exists in the dictionary.`
`Input:Dictionary: { hello, cat, world, dog, bird, grass, green, help, greet, great }String: gggraasssaOutput: FalseExplanation: The a at the end is not the result of a stuck key, and thus it is impossible for it to exist in the dictionary.`
`Input: accounts = [["John", "johnsmith@mail.com", "john00@mail.com"], ["John", "johnnybravo@mail.com"], ["John", "johnsmith@mail.com", "john_newyork@mail.com"], ["Mary", "mary@mail.com"]]Output: [["John", 'john00@mail.com', 'john_newyork@mail.com', 'johnsmith@mail.com'],  ["John", "johnnybravo@mail.com"], ["Mary", "mary@mail.com"]]`

--

--

## More from Abhijit Mondal

Engineer

Love podcasts or audiobooks? Learn on the go with our new app.