arrays fundamental questions from tuf

Author: jwala-anirudh

.gitignore

@@ -0,0 +1,29 @@
+### IntelliJ IDEA ###
+out/
+!**/src/main/**/out/
+!**/src/test/**/out/
+
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+bin/
+!**/src/main/**/bin/
+!**/src/test/**/bin/
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store

.idea/.gitignore

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

.idea/misc.xml

@@ -0,0 +1,5 @@
+public class Main {
+    public static void main(String[] args) {
+        System.out.println("Hello, World!");
+    }
+}

.idea/modules.xml

@@ -0,0 +1,19 @@
+package arrays.fundamentals;
+
+public class LargestElement {
+    public static int largestElement(int[] nums) {
+        int largestElement = nums[0];
+
+        for (int num : nums) {
+            largestElement = Math.max(largestElement, num);
+        }
+
+        return largestElement;
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {3, 3, 6, 1};
+
+        System.out.println(largestElement(nums));
+    }
+}

.idea/vcs.xml

@@ -0,0 +1,20 @@
+package arrays.fundamentals;
+
+public class LinearSearch {
+    public static int linearSearch(int[] nums, int target) {
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] == target) {
+                return i;
+            }
+        }
+
+        return -1;
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {2, 3, 4, 5, 3};
+        int target = 3;
+
+        System.out.println(linearSearch(nums, target));
+    }
+}

dsa-2025.iml

@@ -0,0 +1,25 @@
+package arrays.fundamentals;
+
+public class MaxConsecutiveOnes {
+    public static int findMaxConsecutiveOnes(int[] nums) {
+        int maxCount = 0;
+        int count = 0;
+
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] == 1) {
+                count += 1;
+                maxCount = Math.max(maxCount, count);
+            } else {
+                count = 0;
+            }
+        }
+
+        return maxCount;
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {0,1,0,1,0,1,0,1,0,1,1,1,0,0,0,1,1,1,0,1,0,0,1,0,0,0,0,1,1,1,1,1,0,0,1,1,1,0,1,1,1,1,0,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,1,1,1,1,1,1,1};
+
+        System.out.println(findMaxConsecutiveOnes(nums));
+    }
+}

src/Main.java

@@ -0,0 +1,66 @@
+package arrays.fundamentals;
+
+import java.util.Arrays;
+
+public class SecondLargestElement {
+    public static int secondLargestBrute(int[] nums) {
+        // Sort the given array in ascending ordering
+        Arrays.sort(nums);
+
+        // Get the largest element
+        int largestElement = nums[nums.length - 1];
+
+        // Search for the second-largest element
+        for (int i = nums.length - 2; i >= 0; i--) {
+            if (nums[i] < largestElement) {
+                return nums[i];
+            }
+        }
+
+        return -1;
+    }
+
+    public static int secondLargestBetter(int[] nums) {
+        // Avoid sorting in this approach
+        // rather find the largest and then look for second-largest
+
+        int largestElement = Integer.MIN_VALUE;
+        int secondLargestElement = Integer.MIN_VALUE;
+
+        for (int num: nums) {
+            largestElement = Math.max(largestElement, num);
+        }
+
+        for (int num : nums) {
+            if (num > secondLargestElement && num != largestElement) {
+                secondLargestElement = num;
+            }
+        }
+
+        return secondLargestElement == Integer.MIN_VALUE ? -1 : secondLargestElement;
+    }
+
+    public static int secondLargestOptimal(int[] nums) {
+        int largestElement = Integer.MIN_VALUE;
+        int secondLargestElement = Integer.MIN_VALUE;
+
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] > largestElement) {
+                secondLargestElement = largestElement;
+                largestElement = nums[i];
+            } else if (nums[i] > secondLargestElement && nums[i] != largestElement) {
+                secondLargestElement = nums[i];
+            }
+        }
+
+        return secondLargestElement == Integer.MIN_VALUE ? -1 : secondLargestElement;
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {3, 3, 6, 1};
+
+        System.out.println(secondLargestBrute(nums));
+        System.out.println(secondLargestBetter(nums));
+        System.out.println(secondLargestOptimal(nums));
+    }
+}