Meet in the middle

Difficulty Level : Hard

Given a set of n integers where n <= 40. Each of them is at most 1012, determine the maximum sum subset having sum less than or equal S where S <= 1018.

Linear Diophantine Equations

Difficulty Level : Medium

A Diophantine equation is a polynomial equation, usually in two or more unknowns, such that only the integral solutions are required.

Writing Great Unit Tests

Difficulty Level : Hard

We will look at 10 simple tips and tricks on writing unit tests in JavaScript

React Crash Course

Difficulty Level : Easy

Crash course to learn the React JavaScript library. We will look at components, hooks and more

What's New In PHP 8?

Difficulty Level : Medium

In this article we will look at some of the new features offered in version 8 of PHP

Python Book Review

Difficulty Level : Easy

In this review, we will be looking at the new Python book from Oriley

Django Crash Course

Django is a very powerful, high level Python framework for building web applications

Tailwind vs. Bootstrap

Difficulty Level : Medium

Both Tailwind and Bootstrap are very popular CSS frameworks. In this article, we will compare them

JavaScript Performance Tips

We will look at 10 simple tips and tricks to increase the speed of your code when writing JS