What is a Bipartite Graph?
A Bipartite Graph is a graph whose vertices can be divided into two sets such that no two vertices within the same set are adjacent.
Author: Logan
What is Object-Relational Mapping (ORM)?
An ORM, or object-relational mapping, is a programming technique that allows a software application to access and manipulate a database.
Web Development – Application Server & Web Server (Quick Notes)
Dynamic content refers to website content that changes based on user input or other factors. This can include things like personalised recommendations or customised display.
What is a web framework?
A web application framework is a software framework that is designed to support the development of dynamic websites, web applications and web services. The framework aims to alleviate the overhead associated with common activities performed in web development.
Different ways to iterate over C++ Vector
A vector is a data structure for maintaining a set of elements having a specific data type.
Here, we’ll learn about various ways to iterate over a C++ Vector. (Some of the following ways could also be used with other C++ containers like list, queue, map etc.)
Coin Change II – LeetCode Solution [Medium]
You are given an integer array coins representing coins and an integer amount. Return the number of combinations that make up that amount.
Coin Change – LeetCode Solution [Medium]
You are given an integer vector coins[n] representing coins of different denominations and an integer amount representing a total amount of money.
How to automate replication of MySQL data to AWS Redshift?
We’ll use Rails framework and a Java service for this task. Ruby on Rails, or Rails, is a server-side web application framework written in Ruby under the MIT License.
Custom Randomize | Generate Integers with Equal Probability
Given a function foo(), that returns an integer between 1 and 5 with equal probability. Write a function using foo() that returns an integer between 1 and 7.
Reservoir Sampling
Reservoir sampling is a category of randomised algorithms for choosing a simple random sample, without replacement, of k items