Java and screenshot of output and code

Given an array of integers, return indices of the two numbers such that they add up to a specific

target. You may assume that each input would have exactly one solution, and you may not use

the same element twice. Example:

Given nums $=[2,7,11,15],$ target $=9,$

Because nums$[0]+$ nums$[1]=2+7=9,$ return $[0,1].$

Write a function to find the longest common prefix string amongst an array of strings.

Input: $["$flower$",$ "flow", "flight"$]$ Output: $"$fl$"$

Input: $["$dog$",$ "racecar", "car"$]$ Output: $""$

Explanation: There is no common prefix among the input strings.