Codium

There are 3 questions in total, and I need to go to the company in person. Given an array like [1, 1, 1], I need to transform it into a specified array, where I can replace one element with the sum of the array elements each time. How many transformations are required? Given a file, I need to find a specified pattern match within it. Assumptions (*) are allowed (meaning anything can be substituted). Write a project about graph executor DAG. It's quite difficult. Please give me some points!