Hello world!

my coding adventure

Knapsack Algorithm

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.

Dijkstra’s Algorithm

== vs. ===

Javascript implements dynamic typing and typecasting. We can coerse one type to another explicitly or let Javascript do it for us.

const    x=54;
const  explisit=String(x);  // explisit==="54"
const  implisit=x+"";           // implisit==="54"

In the second example we rely on Javascript behavior to coerse a number to a string.

React.JS Client with Ruby on Rails API. Stage 2: Design

React.JS Client with Ruby on Rails API. Stage 1: Conceptualization

App development is about solving problems. There is a need in the world and an app may help to address it. What is that need?