Functional Programming library for Java
-
Updated
Jun 15, 2024 - Java
Functional Programming library for Java
Data Structures & Algorithms problems that I solve over various coding platforms.
Memoization & Tabulation
Data Structures and Algorithms
All code samples, scripts and more in-depth examples for The Apache Ignite Book. Include Apache Ignite 2.6 or above
This Java program utilizes dynamic programming with memoization to solve the problem of counting the number of distinct ways to climb a staircase, where each step involves choosing between climbing one or two steps.
A Java implementation of an algorithm that determines if a target string can be constructed by concatenating elements from a given word bank, using recursion and memoization for optimization.
This Java project focuses on implementing a dynamic programming solution to find the shortest combination of numbers that sum up to a given target sum, using recursion and memoization for efficiency.
A short Java-based project that explores the problem of determining if a target sum can be achieved using elements from a given array, employing both a basic recursive approach and an optimized version using memoization
This Java program defines two functions, howSum and improvedHowSum, to find a combination of numbers that add up to a given target sum, using a simple recursive approach and a more efficient recursive approach with memoization, respectively.
A computational exploration of combinatorial mathematics, aimed at solving the problem of counting all possible paths in an m x n grid using recursive and dynamic programming techniques with memoization for enhanced efficiency.
This Java program calculates Fibonacci numbers using two methods: a simple recursive approach and an optimized dynamic programming approach with memoization. It explores algorithm efficiency, recursive function calls, and the use of memoization to improve computational performance.
This project is a Java implementation of a program designed to solve the Paper Roll Cutting problem. The goal is to determine the optimal way to cut a paper roll of length n to maximize revenue. This project is implemented using Dynamic Programming with a bottom-up approach and memoization.
longest Common subsequence and their length
Persistent data structures and more. A collection of functional tools I've written for writing functional java.
Add a description, image, and links to the memoization topic page so that developers can more easily learn about it.
To associate your repository with the memoization topic, visit your repo's landing page and select "manage topics."