Code Mastery Challenge

Debug the following code snippet: int x = 5; for(int i = 0; i < x; i++) { System.out.println(i); }

• The loop will print numbers from 1 to 5

• No issues found in the code snippet.

• The loop will print numbers from 0 to 4

• The loop will print numbers from 0 to 5

Optimize the performance of the following code: for(int i = 0; i < 1000; i++) { System.out.println(i); }

• Adding a sleep statement inside the loop

• Using a LinkedList instead of StringBuilder

• StringBuilder sb = new StringBuilder(); for(int i = 0; i < 1000; i++) { sb.append(i).append('\n'); } System.out.println(sb.toString());

• Removing the loop and printing each number individually

Solve the real-world problem: Given an array of integers, find the maximum difference between any two elements.

• The correct answer is to find the maximum difference between any two elements in the array of integers by subtracting the minimum value from the maximum value.

• Sort the array in descending order

• Find the average of the elements in the array

• Calculate the sum of all elements in the array

Debug the following code snippet: String str = 'Hello World'; System.out.println(str.substring(0, 5));

• String str = 'Hello World'; System.out.println(str.substring(0, 6));

• String str = 'Hello World'; System.out.println(str.substring(0, 5));

• String str = "Hello World"; System.out.println(str.substring(0, 5));

• String str = 'Hello World'; System.out.println(str.substring(1, 5));

Optimize the performance of the following code: List numbers = new ArrayList<>(); for(int i = 0; i < 1000000; i++) { numbers.add(i); }

• List numbers = new ArrayList<>(); for(int i = 0; i < 1000000; i++) { numbers.add(i); numbers.remove(0); }

• List numbers = new ArrayList<>(); for(int i = 0; i < 1000000; i++) { numbers.add(0, i); }

• List numbers = new ArrayList<>(1000000); for(int i = 0; i < 1000000; i++) { numbers.add(i); }

• List numbers = new LinkedList<>(); for(int i = 0; i < 1000000; i++) { numbers.add(i); }

Solve the real-world problem: Implement a function to check if a given string is a palindrome.

• function checkPalindrome(str) { return str === str.split('').reverse().join(''); }

• function isPalindrom(str) { return str === str.split('').reverse().join(''); }

• function palindromeCheck(str) { return str === str.split('').reverse().join(''); }

• function isPalindrome(str) { return str === str.split('').reverse().join(''); }

Debug the following code snippet: int[] arr = {1, 2, 3, 4, 5}; for(int i = 0; i <= arr.length; i++) { System.out.println(arr[i]); }

• int[] arr = {1, 2, 3, 4, 5}; for(int i = 0; i < arr.length; i++) { System.out.println(arr[i]); }

• int[] arr = {1, 2, 3, 4, 5}; for(int i = 0; i < arr.length - 1; i++) { System.out.println(arr[i]); }

• int[] arr = {1, 2, 3, 4, 5}; for(int i = 1; i < arr.length; i++) { System.out.println(arr[i]); }

• int[] arr = {1, 2, 3, 4, 5}; for(int i = 0; i < arr.length; i++) { System.out.println(arr[i]); }

Optimize the performance of the following code: int result = 0; for(int i = 0; i < 1000000; i++) { result += i; } System.out.println(result);

• 1000000000

• 500000500000

• 499999500001

• 499999500000

Solve the real-world problem: Given a list of strings, find the longest common prefix among them.

• Sort the strings alphabetically.

• Implement the above algorithm in code to find the longest common prefix.

• Count the total number of characters in the list of strings.

• Find the shortest common suffix among the strings.

Debug the following code snippet: int num = 10; if(num % 2 == 0) { System.out.println('Even'); } else { System.out.println('Odd'); }

• int num = 10; if(num % 2 != 0) { System.out.println('Even'); } else { System.out.println('Odd'); }

• int num = 5; System.out.println('Even');

• int num = 10; if(num % 2 == 0) { System.out.println("Even"); } else { System.out.println("Odd"); }

• int num = 10; System.out.println('Odd');