mayank926 Goto Github PK

01knapsack

Recursive Memoization 01 Knapsack

avltree

Java code to implement AVL Tree

bfstraversalofbst

Level Order traversal (BFS) or BST

binarysearchtree

Simple implementation of BST insertion search and deletion

booleanparenthesization

bstpreordertopostorder

Simple Java program to create BST from Preorder traversal using recursion and do Post order traversal

bsttobalancedbst

Simple Java Program to Convert a given BST to Balanced BST

convertdecimaltofractions

Simple Java class to convert fractions to decimal

countnodesinrangebst

Simple Java code to count number of nodes present in a BST within a given range

dockerspringboot

SpringBoot Docker application for Jenkins Pipeline

eggdropproblem

Java code for egg drop problem

equalsumpartition

Simple Java code for Equal Sum Partition Problem using Dynamic Programming

exceptionallyodd

Simple Java code for GFG problem Exceptionally Odd

fixbstwithswappedpair

fractionalknapsack

Simple Java code for fractional knapsack

generatebalancedparanthesis

Use of recursive algorithm to generate all balanced parenthesis combinations

hello-world

Learn Git

javawebinars

Codes for Java Webinars.

jobsequencing

Greedy algorithm Job sequencing java implementation

localstackspringkinesisbinder

Use Spring cloud stream kinesis binder with localstack container

longestcommonsubsequence

Java code to print one of the longest common subsequences

longestcommonsubstringlength

Simple Java Program with DP for length of Longest Common substring

matrixchainmultiplication

Matrix Chain multiplication code

mergebsts

Simple Java program to merge 2 BSTs

minimizetheheights

Increase/decrease height by K and get min difference of max and min height of towers

minnoofcoins

Simple Java program using Dynamic Top down for Minimum number of coins to get a given sum

minxora

Simple Java code to find Min XOR value for A, with matching number of bits from B

morristraversalbst

Simple Java code showing Morris Traversal on BST

palindromicpartition

Simple Java code of finding minimum number of partitions required to split string into palindromes

rodcutting

Simple Rod Cutting problem implementation (Unbounded knapsack)