0-1 Knapsack| Subset Sum problem - Dynamic Programming Classical Example

Linked Lists explained with illustration of Memory State! (I2204 chap04 complete)

C – Structures (struct): Essentials for Linked Lists (I2204 ch 3 complete)

C Heavy Weapons:Arrays of Pointers, Multiple Indirection & Void Pointer (I2204 ch 2 sections 6 & 7)

C – Strings versus Arrays of Characters Deciphered! (I2204 ch 2 sec 5)

Cloneable Interface & Object Cloning (INFO 404 ch 02 section 1.c)

Properties & Features of Java Interfaces (INFO 404 chap 02 sec 1b)

The Java Interface Concept: Comparable & Comparator Interfaces (INFO404 chap02 section 1.a)

C weapons: Arrays as Pointers (I2204 chap 2 sec 4)

The NULL pointer + the Bad & the Good Swap function (I2204 chap 2 sec 3)

Easy Peasy Pointers in C: Definition & Operations (I2204 chap2 sec 1 & 2)

Java ArrayLists, Wrappers, Enum, Varargs, Reflection & Hints (INFO404 chap01 part 2)

Java Inheritance + Object Cosmic Superclass (INFO404: ch01 part 1)

Recursive functions, their types and rules (I2204: ch01 part 2)

The memory state and function calls (I2204: ch01 part 1)

Video Coding Standards - from H.261 to MPEG1,2,4,7 - to H.265 MPEG-H

Longest Increasing Subsequence (LIS) Dynamic Programming

Max 1D & 2D Range Sum - Dynamic Programming

UVa 10003 - Cutting Sticks - Non-Classical Dynamic Programming problems

UVa 10943 - How do you add? - Non-Classical Dynamic Programming Examples

Traveling Salesman Problem (TSP) Dynamic Programming Classical Example

Image Compression Standards

Coin Change (CC) - The General Version - Dynamic Programming Classical Example

0-1 Knapsack| Subset Sum problem - Dynamic Programming Classical Example

Dynamic Programming Top-Down & Bottom-Up Approaches - Space Saving Technique - Display the Solution