GeeksforGeeks

Everything about GeeksforGeeks

1. Article · Data Structures and Algorithms (DSA)

   Minimum Cost Pizza Selection Using Dynamic Programming

   Learn how to solve the Minimum Cost Pizza Selection problem using Dynamic Programming. Given the area and cost of Small, Medium, and Large pizzas, the goal is to find the minimum cost required to achieve a total area of at least x. This article explains the DP approach, state definition, transition, handling of area greater than x, dry run, Java implementation, and complexity analysis.

   Sandhiya PriyaSep 262,9331,000
2. Article · Java

   Maximize Sum of Adjacent Differences with 1 Replacement

   Given an integer array, you can replace any number of elements with 1. The goal is to maximize the sum of absolute differences between consecutive elements. This article explains how to solve the problem efficiently using a two-state Dynamic Programming approach in O(n) time and O(1) auxiliary space. It includes the intuition, DP states, transitions, Java implementation, and a step-by-step dry run.

   Sandhiya Priya
3. Article · Data Structures and Algorithms (DSA)

   Count Palindromic Strings with Constraints

   Learn how to count palindromic strings of length up to n using the first k lowercase English letters, where no character appears more than twice. This article explains the key palindrome observations, separates even and odd-length cases, derives the permutation formulas, and provides an efficient Java solution using modular arithmetic. The solution achieves O(k) time complexity and O(1) auxiliary space.

   Sandhiya PriyaSep 22,4721,000
4. Article · Data Structures and Algorithms (DSA)

   Count Subsequences Divisible by N Using Dynamic Programming in Java

   Count Subsequences Divisible by N is a Dynamic Programming problem where we need to count the number of non-empty subsequences of a numeric string whose numeric value is divisible by a given integer n. The solution uses remainder-based DP to efficiently track subsequences for each possible remainder instead of generating all subsequences. The approach runs in O(|s| × n) time and O(n) space and handles large inputs efficiently.

   Sandhiya PriyaSep 24,2491,000
5. Article · Data Structures and Algorithms (DSA)

   Count Prefix-Balanced Binary Strings - Java Explanation

   Count the number of prefix-balanced binary strings of length 2 * n containing exactly n ones and n zeros, where every prefix has at least as many ones as zeros. This article explains the Dynamic Programming approach in Java, including the DP transition, base case, dry run, Catalan number connection, and time and space complexity.

   Sandhiya PriyaAug 242,1981,000
6. Article · Data Structures and Algorithms (DSA)

   Subset Sum on Generated Sequence

   Subset Sum on Generated Sequence is a Greedy Algorithm problem where a sequence is dynamically generated from an initial value s and the given array arr[]. Each new value is calculated using the sum of all previously generated values plus the current array element. The generated sequence has a special property where each new value is greater than the sum of all previous values. This property allows us to determine whether a target x can be formed efficiently by processing the sequence from largest to smallest and greedily selecting suitable values. The solution runs in O(n) time and uses O(n) auxiliary space.

   Sandhiya PriyaAug 143391,000
7. Article · How do I

   Top 10 Sites For Interview Preparation

   In this article, you will learn about the top 10 sites for interview preparation.

   Pankajkumar PatelAug 6, 202047,3541,000