← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Meta Phone Screen (Mock)
Problem 1: Given a string s, and a target string t, find how many instances of s are required to construct t using the letters from s.
Example: s = "leetcode", t = "decode" Answer is 2
Problem 2: Maximum Sum Circular Subarray