2 questions asked in this round:

Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.

In other words, return true if one of s1's permutations is the substring of s2.

i/p - s1 = "ab", s2 = "eidboaoo"
o/p - false

i/p - s1 = "ab", s2 = "eidbaooo"
o/p - true

Kiki loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
Kiki can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile.
If the pile has less than k bananas, she eats all of them instead and will not eat any more bananas during this hour.

Kiki likes to eat slowly but still wants to finish eating all the bananas before the guards return.

Return the minimum integer k such that she can eat all the bananas within h hours.

piles = [3,6,7,11], h = 8
o/p - 4

piles = [30,11,23,4,20], h = 5
o/p - 30

piles = [30,11,23,4,20], h = 6
o/p - 23