Foundations: Java Tools & Complexity Analysis

Use List (ArrayList, LinkedList), Set (HashSet, TreeSet), and Map (HashMap, TreeMap) from the Java Collections Framework, explaining their performance trade-offs.

Implement the Comparable interface and custom Comparators for sorting objects in Java.

Handle fast input/output in Java using BufferedReader and StringBuilder for competitive programming scenarios.

Analyze the time complexity of iterative and recursive algorithms (Big O notation).

Analyze the space complexity of algorithms, including auxiliary space and the recursion stack.

Apply the two-pointer technique to solve problems on sorted arrays and strings (e.g., pair sum, palindrome check).

Implement and apply the sliding window technique for fixed and variable size window problems on arrays.

Use built-in Java methods for sorting (Arrays.sort, Collections.sort) and understand when to use them.