61 docs tagged with "programming"

In this tutorial, we will learn about A* Algorithm and its implementation in Python, and C++ with detailed explanations and examples.

Approximation Algorithm

In this tutorial, we will learn about arrays and strings in programming. We will discuss what arrays and strings are, how they are used, and how they are different from each other.

Programming is the process of writing instructions for a computer to perform a specific task. It involves writing code in a programming language that the computer can understand and execute. Programming is an essential skill for any software developer or computer scientist. In this tutorial, we will cover the basics of programming, including the following topics:

In this tutorial, we will learn about the Bellman-Ford Algorithm and its solution using Dynamic Programming in Python, Java, and C++ with detailed explanations and examples.

In this , we will learn about Bin Packing Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

Branch and Bound

Hello, C++ enthusiasts! Today, we’re diving into one of the most essential and versatile components of the C++ Standard Template Library (STL): the iterator. If you’re looking to enhance your understanding and utilization of iterators in C++, you’re in the right place. This guide will cover everything you need to know about iterators, from basic usage to advanced features, complete with examples and practical applications.

Hello, C++ aficionados! Today, we're diving into one of the most fundamental and flexible components of the C++ Standard Template Library (STL): the list. If you're looking to enhance your understanding and utilization of lists in C++, you're in the right place. This guide will cover everything you need to know about lists, from basic usage to advanced features, complete with examples and practical applications.

Hello, C++ enthusiasts! Today, we're diving into one of the most powerful and unique components of the C++ Standard Template Library (STL): the set. If you're looking to enhance your understanding and utilization of sets in C++, you're in the right place. This guide will cover everything you need to know about sets, from basic usage to advanced features, complete with examples and practical applications.

Welcome back, C++ enthusiasts! Today, we're going to take a deep dive into one of the most versatile and widely used components of the C++ Standard Template Library (STL): the vector. If you’re looking to enhance your understanding and utilization of vectors in C++, you’re in the right place. This guide will cover everything you need to know about vectors, from basic usage to advanced features, complete with examples and practical applications.

In this tutorial, we will learn about the Coin Change Problem and its solution using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

Tractable and Intractable

In this tutorial, we will delve into deque (double-ended queue) in Data Structures and Algorithms. We'll explore what deque is, how it's used, and its implementation in various programming languages.

In this tutorial, we will learn about Dijkstra's Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about the Edit Distance problem and its solution using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about the Fibonacci sequence and its implementation using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

Greetings, C++ enthusiasts! Today, we’re going to dive into the world of functors, also known as function objects. If you’re eager to enhance your C++ skills and learn how to create flexible, reusable functions, you’ve come to the right place. This comprehensive guide will cover everything you need to know about functors, from basic usage to advanced features, complete with practical examples.

What is Graph Data Structure

In this tutorial, we will learn about graphs in Data Structures and Algorithms. We will discuss what graphs are, how they are used, and why they are important.

In this tutorial, we will learn about Hash Tables, their uses, how they work, and hashing in general with detailed explanations and examples.

Backtracking

In this tutorial we will explore one of the fundamental data structure in computer science: Binary Tree

Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming point of view. It is all about Bitwise Operators which directly works upon binary numbers or bits of numbers that help the implementation fast. Below are the Bitwise Operators that are used:

Data Structures and Algorithms (DSA) are the building blocks of computer programming. They are essential tools for any programmer to have in their toolkit. They help in writing efficient code and solving complex problems.

Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of subproblems so that we do not have to re-compute them when needed later. This simple optimization reduces time complexities from exponential to polynomial.

Greedy Algorithm is defined as a method for solving optimization problems by taking decisions that result in the most evident and immediate benefit irrespective of the final outcome. It works for cases where minimization or maximization leads to the required solution.

Introduction

In this tutorial, we will learn about Kadane’s Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

Kruskal's algorithm is a popular method used to find the minimum spanning tree (MST) of a connected, undirected graph. A minimum spanning tree is a subset of the edges in a graph that connects all the vertices together, wihout any cycles, and with minimum possible total edge weight.

1. 46. Permutations

1. Number of 1 Bits - Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).

Here is a list of some popular LeetCode dynamic programming problems:

1. Jump Game

Questions

Introduction:

In this tutorial, we will learn about linked lists in Data Structures and Algorithms. We will discuss what linked lists are, how they are used, and how they are different from arrays.

In this tutorial, we will learn about the Longest Common Subsequence (LCS) problem and its implementation using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about the Longest Increasing Subsequence (LIS) problem and its implementation using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about the Matrix Chain Multiplication problem and its solution using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will delve into the concept of a monotonic stack in Data Structures and Algorithms. We'll explore what a monotonic stack is, how it works, and its applications.

In this tutorial, we will learn about Moore's Voting Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about the Multistage Graph Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about the Palindrome Partitioning problem and its solution using Dynamic Programming in Python, Java, and C++ with detailed explanations and examples.

In this tutorial, we will learn about the Partition Problem and its solution using Dynamic Programming in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about Prim's Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we will learn about Prim's Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

In this tutorial, we'll explore priority queues in Data Structures and Algorithms. We'll discuss what priority queues are, how they're used, and how to implement them in various programming languages.

Randomised Algorithm

Sliding Window problems are problems in which a fixed or variable-size window is moved through a data structure, typically an array or string, to solve problems efficiently based on continuous subsets of elements. This technique is used when we need to find subarrays or substrings according to a given set of conditions.

1. Sliding Window Maximum

In this tutorial, we will learn about stacks and queues in Data Structures and Algorithms. We will discuss what stacks and queues are, how they are used, and how they are different from each other.

In this tutorial, we will learn about Tarjan's Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.

Greetings, aspiring C++ wizards and seasoned coders alike! Today, we embark on an exciting journey through the magical realm of the C++ Standard Template Library, or STL. This powerful toolkit is the secret weapon in every C++ programmer's arsenal, offering a treasure trove of pre-written code that can make solving data structure and algorithm problems a breeze. So, grab your wand (or keyboard), and let’s dive into the world of STL, where efficiency meets elegance in C++ programming.

Hello, C++ enthusiasts! Today, we’re diving into one of the most fundamental and versatile components of the C++ Standard Library: the find algorithm. If you're looking to enhance your understanding and utilization of searching in C++, you're in the right place. This guide will cover everything you need to know about the find algorithm, from basic usage to advanced features, complete with examples and practical applications.

Hello, C++ enthusiasts! Today, we’re diving into one of the most fundamental and powerful components of the C++ Standard Library: the sort algorithm. If you're looking to enhance your understanding and utilization of sorting in C++, you're in the right place. This guide will cover everything you need to know about the sort algorithm, from basic usage to advanced features, complete with examples and practical applications.

What is Time Complexity?

In this tutorial, we will learn about the Travelling Sales Person Algorithm and its solution using Dynamic Programming in Python, Java, and C++ with detailed explanations and examples.

In this tutorial, we will learn about Wildcards Matching and its solution using Dynamic Programming in Python, Java, and C++ with detailed explanations and examples.

In this tutorial, we will learn about the Word Break Problem and its implementation in Python, Java, and C++ with detailed explanations and examples.

In this tutorial, we will learn about the Z-Algorithm and its implementation in Python, Java, and C++ with detailed explanations and examples.