Java Java need help. Hello, Please complete this 2 coding challenge. I need explanation how your solution work. Thank you

Solutions a easy Discussion Java Vim Mode Light Mode Reset Code Run Code Run Test Cases Submit import java.util.*; import java.io.*; "Argument goes here" class Main { 1 1 2 3 4 5 6 7 8 9 Longest Word Have the function Longestword (sen take the Ben parameter being passed and return the largest word in the string. If there are two or more words that are the same length, return the first word from the string with that length. Ignore punctuation and assume sen will not be empty. output Logs will appear here public static String Longestword(String sen} { // code goes here return sen; } Examples 10 11 12 13 14 15 public static void main(String[] args) { // keep this function call here Scanner s = new Scanner(System.in); System.out.print(Longestwordis.nextLine()); } Input: "fun&!! time" Output: time 16 17 } Input: "I love dogs" Output: love Tags string manipulation searching free E Description A Solution Discuss (999+) Submissions i Java Autocomplete 1 189. Rotate Array class Solution { public void rotate(int nums, int k) { 2 3 Medium L 3987 898 Add to List Share } 3 Given an array, rotate the array to the right by k steps, where k is non-negative. Follow up: different Try to come up as many solutions as you can, there are at least ways to solve this problem. Could you do it in-place with O(1) extra space? Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 steps to the right: [7,1,2,3,4,5,6) rotate 2 steps to the right: [6,7,1,2,3,4,5) rotate 3 steps to the right: [5,6,7,1,2,3,4] Example 2: Input: nums = (-1,-100,3,99), k = 2 Output: (3,99,-1,-1001 Explanation: rotate 1 steps to the right: 199,-1,-100,3] rotate 2 steps to the right: [3,99,-1,-100]