Find optimal number of maximum leds that can be powered using 2 dimentional dynamic programming
-
Updated
Mar 16, 2023 - Java
Find optimal number of maximum leds that can be powered using 2 dimentional dynamic programming
Here are some of my Data structures and algorithms created in Java Programming Language using IntelliJ IDE.
Contains the code of different DP problems. ie. 0/1 knapsack, unbounded-knapsack, Fibonacci, and different variations of similar problems.
When two audio files compared, the result is giving the similar part from the two audio files, using CMU Sphinx4.
this is a Copariso project that have no socket connection. It will end in 1 app.
An OOP project which can simulate six different types of dynamic programming based problems
Solr API,Twitter4j
Max LED Lighting problem involves connecting LEDs to corresponding power sources to maximize the number of LEDs without allowing wires to cross.
Contains Plagarism checking, implemented with the concept of Longest common subsequence.
LCS probelm
Given two strings with the characters "ACGT" This program will print the longest subsequence using dynamic programming.
Reads text files to find longest common sub-sequence (lcs), assigns plagiarism scores based on lcs.
Data Structures and Algorithms
To find the Longest Common Subsequence(LCS) of two Strings
Algorithms based on dynamic programming
This package allow use strings operations to generic sequence
Final project for CSS 590: Software Traceability. Originally designed to be a diff tool using the JavaCC parse library.
Add a description, image, and links to the longest-common-subsequence topic page so that developers can more easily learn about it.
To associate your repository with the longest-common-subsequence topic, visit your repo's landing page and select "manage topics."