Algorithms

Learn

Existing chapters for this concept.

• Algorithms

  Algorithms

  Always state time and space complexity in interviews.

  Open lesson →

See it in code

Existing Java examples.

• algorithms 1 Sorting Algorithms

  Algorithms · pkg4algorithms/algorithms1SortingAlgorithms.java · pkg4algorithms · algorithms1SortingAlgorithms.java

  Open example →
• algorithms 2 Searching Algorithms

  Algorithms · pkg4algorithms/algorithms2SearchingAlgorithms.java · pkg4algorithms · algorithms2SearchingAlgorithms.java

  Open example →
• algorithms 3 Greedy Algorithms

  Algorithms · pkg4algorithms/algorithms3GreedyAlgorithms.java · pkg4algorithms · algorithms3GreedyAlgorithms.java

  Open example →
• algorithms 4 Dynamic Programming

  Algorithms · pkg4algorithms/algorithms4DynamicProgramming.java · pkg4algorithms · algorithms4DynamicProgramming.java

  Open example →
• algorithms 5 Backtracking

  Algorithms · pkg4algorithms/algorithms5Backtracking.java · pkg4algorithms · algorithms5Backtracking.java

  Open example →
• algorithms 6 Graph Algorithms

  Algorithms · pkg4algorithms/algorithms6GraphAlgorithms.java · pkg4algorithms · algorithms6GraphAlgorithms.java

  Open example →
• algorithms 7 Divide And Conquer

  Algorithms · pkg4algorithms/algorithms7DivideAndConquer.java · pkg4algorithms · algorithms7DivideAndConquer.java

  Open example →

Practice

Existing LeetCode material in JavaForge.

• Maximum Subarray

  Blind 75 · Array · pkg5leetcode/blind75/blind75_LC53MaximumSubarray.java · pkg5leetcode · blind75_LC53MaximumSubarray.java

  Kadane's algorithm tracks best ending-here sum. Time O(n), Space O(1)

  Open practice →
• Maximum Subarray

  Starter · Kadane · pkg5leetcode/leetcode5MaxSubArray.java · pkg5leetcode · leetcode5MaxSubArray.java

  Find the contiguous subarray with the largest sum. Kadane's algorithm. Track best sum ending here; reset when it goes negative. Time O(n), Space O(1).

  Open practice →

Prepare

Existing interview questions.

• ForkJoinPool algorithm?

  Concurrency & Multithreading — Interview Questions (150+)

  Prefer immutability and high-level concurrency utilities over low-level locks.

  Open question →
• LB algorithms?

  System Design Fundamentals — Interview Questions (80+)

  Start simple; scale the proven bottleneck; justify trade-offs.

  Open question →
• "What Does This Print?" — Java Puzzles (35)

  Interview

  Work each puzzle on paper first, then check the answer. Focus: operator precedence , autoboxing , short-circuit , String pool , generics erasure .

  Open question →

Java versions

• Edwards-Curve Digital Signature Algorithm (EdDSA)

  JEP 339 · Final

  Edwards-Curve Digital Signature Algorithm (EdDSA). The JDK implements EdDSA signatures, a cryptographic API addition.

  Open version note →
• Quantum-Resistant Module-Lattice-Based Digital Signature Algorithm

  JEP 497 · Final

  Quantum-Resistant Module-Lattice-Based Digital Signature Algorithm. The JDK implements ML-DSA, a module-lattice signature algorithm.

  Open version note →