public class Fibonacci { private static final String INDENT = ” “; static void printIndent(int depth) { for (int i […]
Category: Java
Recursion Without Loop
public class RecursionWithoutLoop { static int stepCounter = 1; // Shared counter to label each step // Method A: Top-down […]
linked list queue
// This queue implementation uses a linked list and can dynamically grow and shrink as needed. public class LinkedListQueue { […]
circular array queue
// Circular Array queue implementation using a linear array public class CircularArrayQueue { // Array-based fields final int[] arr; // […]
simple array queue
// Simple Array queue implementation using a linear array public class SimpleArrayQueue { final int[] arr; // Queue storage array […]
Rain Water Trap
# Dynamic Plan public class RainWaterTrap { public static int trap(int[] height) { if (height == null || height.length < […]
Trapping Rain Water
# Double Pointers public class TrappingRainWater { public static int trap(int[] height) { if (height == null || height.length == […]
Linked List Print
public class LinkedListPrint { // Node class representing each element in the linked list public static class Node { int […]
Linked List Locate From End
public class LinkedListLocateFromEnd { // Static inner class representing a node public static class Node { int data; Node next; […]
Linked List Deletion
public class LinkedListDeletion { // Static nested class for node public static class IntNode { int data; IntNode link; public […]