## The Bootstrap toolkit

### Published on 2018-09-24

Bootstrap is a free open-source toolkit for building responsive, mobile-first web projects with HTML, CSS and JavaScript.

web development blog post

Bootstrap is a free open-source toolkit for building responsive, mobile-first web projects with HTML, CSS and JavaScript.

web development blog post

HTML (Hypertext Markup Language) is the building block for creating web applications. It allows us to define the content and layout of a web page.

web development blog post

Most applications need to load fresh data from remote sources. In this post, we discuss how you can use the WebRequest class to fetch data for your UWP application.

desktop apps blog post

Programming competitions are fun. There are several websites and companies (like Google and Facebook) that regularly organize contests. In this post, we look at several tasks from the Qualification Round of Google Code Jam 2018, including their solutions.

competitions blog post

Desktop applications are cool, but what technology or framework should you use to make one? In this post, we look at Electron, Proton Native, WPF, Windows Forms and UWP.

desktop apps blog post

Various problems deal with elements and sets. Finding if two elements belong to the same set, and merging two sets into one is a common requirement for solving some graph-related problems. In this post, we will take a look at the disjoint-set (i.e. union-find) data structure.

algorithms blog post

Often, we need to count the number of elements in a set, a union of multiple finite sets, or to enumerate different solutions to a problem. The inclusion-exclusion principle is a familiar technique for obtaining those values.

algorithms blog post

Breadth-first search is an algorithm that can be applied to a wide range of problems dealing with graph theory. Finding the shortest path in a maze, calculating the minimum number of operations required to go from one state to another, and more, are just some examples of using BFS.

algorithms blog post

Have you ever wondered how Google Maps can calculate the shortest path between two cities so quickly? In this post, we will discuss Dijkstra's algorithm for calculating shortest paths starting from a given node in a graph.

algorithms blog post