AlgoGalaxy

AlgoGalaxy

University
CodeRush
Jobs
Tools
Insights
Explore
Personalize
KotlinGoPHPRustGraphsArraysBit ManipulationDynamic ProgrammingGreedyHeapLinked ListStackStringsTreesTrieBacktrackingBinary SearchBSTComplexity AnalysisData Structures & Algorithms

Java | For Loop

A for loop keeps initialization, condition and update together when iteration has a known shape. Use it for indexes, counts and collection traversal, but make each loop's ownership clear: know which value changes, which values are read and what result the loop is building.

Use the Right Loop Form

Use an indexed for loop when position matters, and an enhanced for loop when you only need each value. Choosing the smaller form prevents needless index mistakes.

Respect Collection Bounds

Array indexes start at zero and end before length. The condition index < values.length keeps every access valid and works for an empty array without a special case.

Accumulate Deliberately

Initialize an accumulator to the identity value for its operation, such as zero for a sum or true for an all-valid check. That makes the empty-input result an intentional policy.

Avoid Mutating During Traversal

Do not casually change a collection while iterating over it. Choose an iterator, a separate result collection or a dedicated API so modification rules are explicit.

Worked Examples

Example 1: Traverse Values Without an Index

The enhanced loop exposes only the current value because the position is irrelevant. This keeps the iteration focused on the calculation rather than bookkeeping.

Java

public class Main {
    public static void main(String[] args) {
        int total = 0;
        for (int value : new int[] {3, 4, 5}) {
            total += value;
        }
        System.out.println("total=" + total);
    }
}

Expected Result

total=12

Example 2: Use an Index When Position Matters

The loop condition prevents access past the end of the array. Printing both the index and value makes the position-to-data relationship observable.

Java

public class Main {
    public static void main(String[] args) {
        String[] names = {"Ada", "Lin"};
        for (int index = 0; index < names.length; index++) {
            System.out.println(index + ":" + names[index]);
        }
    }
}

Expected Result

0:Ada
1:Lin

Example 3: Check Every Input Value

The method returns as soon as it proves an invalid value exists. This is both efficient and clear about the policy: all values must be non-negative.

Java

public class Main {
    static boolean allNonNegative(int[] values) {
        for (int value : values) {
            if (value < 0) return false;
        }
        return true;
    }

    public static void main(String[] args) {
        System.out.println(allNonNegative(new int[] {2, 0, 8}));
    }
}

Expected Result

true

Build and Practice Plan

Build confidence by changing one rule at a time. Start with the normal case, make the expected value visible, then add the nearest boundary and a rejected input. Keep Java syntax in service of the contract: a program is useful only when its behavior remains understandable as inputs, scale and failure conditions change.

  • Step 1: create one normal case, one boundary case and one rejected or failure case for use the right loop form before expanding the implementation.
  • Step 2: create one normal case, one boundary case and one rejected or failure case for respect collection bounds before expanding the implementation.
  • Step 3: create one normal case, one boundary case and one rejected or failure case for accumulate deliberately before expanding the implementation.
  • Step 4: create one normal case, one boundary case and one rejected or failure case for avoid mutating during traversal before expanding the implementation.

Design Review Questions

Before accepting a change, identify the valid values, the owner of mutable state, the behavior for missing or invalid input and the test that proves the important boundary. Keep I/O, storage and framework wiring outside the small Java rule until the local behavior is proven.

A clear result is better than a hidden side effect. Name the condition, return the calculation where possible and let the outer layer decide whether to print, store or transmit it.

Example 4: Make the input visible

Start by naming the value the next line depends on. This keeps the lesson input explicit before we apply a transformation or call an external boundary. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String lesson = "Java For Loop";
        System.out.println(lesson.toUpperCase());
    }
}

Expected Result

JAVA FOR LOOP

Try next: Replace the sample value with one from your own notes, predict the result, and then run it.

Example 5: Make the input visible

Start by naming the value the next line depends on. This keeps the lesson input explicit before we apply a transformation or call an external boundary. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String lesson = "Java For Loop";
        System.out.println(lesson.toUpperCase());
    }
}

Expected Result

JAVA FOR LOOP

Try next: Replace the sample value with one from your own notes, predict the result, and then run it.

Example 6: Make the input visible

Start by naming the value the next line depends on. This keeps the lesson input explicit before we apply a transformation or call an external boundary. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String lesson = "Java For Loop";
        System.out.println(lesson.toUpperCase());
    }
}

Expected Result

JAVA FOR LOOP

Try next: Replace the sample value with one from your own notes, predict the result, and then run it.

Example 7: Guard an empty boundary

A small guard makes the allowed and rejected path visible. We want a caller to receive an intentional result instead of discovering an unexplained failure later. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static boolean accepted(String value) {
        return value != null && !value.isBlank();
    }

    public static void main(String[] args) {
        System.out.println(accepted("Java For Loop"));
    }
}

Expected Result

true

Try next: Try an empty value as well as the normal value and describe why the two outcomes differ.

Example 8: Keep the transformation pure

This step returns a value instead of mixing the rule with display or storage work. That separation gives us a small unit we can run, test, and reuse. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static int doubleValue(int value) { return value * 2; }

    public static void main(String[] args) {
        System.out.println(doubleValue(6));
    }
}

Expected Result

12

Try next: Call the same rule twice with different inputs and confirm that each result depends only on its input.

Example 9: Make a branch deliberate

Use a named branch where the business rule changes. A future reader should be able to point at the condition and state the result for both sides. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        int score = 7;
        String result = score >= 5 ? "ready" : "review";
        System.out.println(result);
    }
}

Expected Result

ready

Try next: Change the boundary value by one and explain exactly which branch becomes active.

Example 10: Use a collection without hidden mutation

Collections become safer when we can see which value is read, which value is derived, and whether the original collection remains owned by the caller. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

import java.util.List;

public class Main {
    public static void main(String[] args) {
        List<String> lessons = List.of("Java For Loop", "boundary");
        System.out.println(String.join(" | ", lessons));
    }
}

Expected Result

Java For Loop | boundary

Try next: Add one more item and predict the derived result before executing the code.

Example 11: Return a named outcome

A named outcome is easier to test than an implied side effect. We can now distinguish a successful path from a rejected path without guessing from console noise. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    record Outcome(String status, String lesson) {}

    public static void main(String[] args) {
        Outcome outcome = new Outcome("ready", "Java For Loop");
        System.out.println(outcome.status());
    }
}

Expected Result

ready

Try next: Rename the outcome in your own words while preserving the same success and failure rule.

Example 12: Trace a small loop

Work through one value at a time. The point is not to memorize syntax; it is to see how the accumulator or output changes after each repeatable step. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        int total = 0;
        for (int value : new int[] {1, 2, 3}) total += value;
        System.out.println(total);
    }
}

Expected Result

6

Try next: Use a shorter collection first, then add one value and trace the extra iteration aloud.

Example 13: Keep display at the edge

The core rule prepares a value, while the outer line decides how to show it. That keeps the result usable by a UI, test, API, or command-line caller. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static String display(String value) { return "Lesson: " + value; }

    public static void main(String[] args) {
        System.out.println(display("Java For Loop"));
    }
}

Expected Result

Lesson: Java For Loop

Try next: Change only the display text and verify that the underlying rule and result stay unchanged.

Example 14: Test the closest boundary

A useful example includes the nearest boundary, not only the happy path. We are making the behavior inspectable before a real caller relies on it. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    static int quantity(int value) {
        if (value < 1) throw new IllegalArgumentException("quantity must be positive");
        return value;
    }

    public static void main(String[] args) {
        System.out.println(quantity(1));
    }
}

Expected Result

1

Try next: Try the lowest supported value and then one value just outside the accepted range.

Example 15: Write a tiny regression check

A compact assertion turns the lesson into a repeatable promise. It helps us catch a changed rule before a larger program hides the source of the mistake. We are applying that habit while revisiting Java For Loop.

Keep the example small enough to trace. First predict the normal result; then change one input and explain the boundary result in your own words.

Java

public class Main {
    public static void main(String[] args) {
        String result = "Java For Loop".toUpperCase();
        if (!result.equals("JAVA FOR LOOP")) throw new AssertionError("contract failed");
        System.out.println("contract holds");
    }
}

Expected Result

contract holds

Try next: Deliberately change the expected value once, observe the failed check, and then restore the correct contract.

Common Mistakes

  • Avoid: treating use the right loop form as a syntax trick while leaving the domain rule, ownership or error behavior implicit.
  • Avoid: treating respect collection bounds as a syntax trick while leaving the domain rule, ownership or error behavior implicit.
  • Avoid: treating accumulate deliberately as a syntax trick while leaving the domain rule, ownership or error behavior implicit.
  • Avoid: treating avoid mutating during traversal as a syntax trick while leaving the domain rule, ownership or error behavior implicit.

Interview Checklist

  • State the input domain and the boundary value before explaining the syntax.
  • Explain the failure or rejected-input outcome rather than assuming the happy path.
  • Identify mutation, ownership and any value that must not be changed by a caller.
  • Name a focused test that would prove the rule still holds after a future change.
  • Separate the local Java decision from printing, persistence, networking or framework code.
logo of AlgoGalaxy

Newsletter

Subscribe to our newsletter for weekly updates and promotions.

AlgoGalaxy University

University HomeTechnology LearningCoding ProblemsLearning ProgressCareer OpportunitiesTechnology InsightsUtilNexa ToolsAlgoGalaxy HomeContact Support

AlgoGalaxy CodeRush

CodeRush HomeProblem SetsProgress TrackerLearn TechnologyTechnology JobsEngineering InsightsDeveloper UtilitiesAlgoGalaxy HomePrivacy Policy
Privacy Policy

 • 

Terms of Service

Copyright © AlgoGalaxy 2026