Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

In this video, we will write a C++ program to multiply two matrices.Multiplication is a fundamental operation in mathematics and computer science. In programming, multiplication is performed using two numbers or variables called operands. Operand means something that is operated upon. An operand can be either a variable or a constant, and a matrix represents the collection of numbers arranged in an order of rows and columns. It is necessary to enclose the elements of a matrix in parentheses or brackets.For Example: Input: mat1[m][n] = { {1, 1}, {2, 2} } mat2[p][q] = { {1, 1}, {2, 2} } Output: result[m][p] = { {3, 3}, {6, 6} }Input mat1[m][n]= { {1 2 &nbsp;3},{ 3 &nbsp;2 &nbsp;1},{ 1 2 &nbsp;3}} mat2[p][q]= { {4 5 6},{ 6 5 4},{4 6 5}}Output: {28 &nbsp;33 &nbsp;29 28 &nbsp;31 &nbsp;31 28 &nbsp;33 &nbsp;29} Multiplication of two Matrices: The number of columns in Matrix-1 must be equal to the number of rows in Matrix-2. The output of multiplication of Matrix-1 and Matrix-2 results with equal to the number of rows of Matrix-1 and the number of columns of Matrix-2 i.e. rslt[R1][C2]Algorithm: Step 1: First declare &nbsp;three matrices m1[3][3], m2[3][3], m3[3][3] and variables sum, i,j,k. Step 2: Now Enter the first and second matrices elements. Step 3: Run for loop from 0 to result. length as i: Step 4: Nest run another for loop from 0 to result[0].length as j: Step 5: Nest another loop from 0 to m1[0].length in k: Step 6: Sum (m1[I][K] * m2[K][J]) Step 7: Store the sum into the resultant matrix as m3[i][j]=sum. Step 8: End loop Step 9: Print the resultant matrix.C++ program to multiply two matrices: <a href="https://www.geeksforgeeks.org/cpp-program-to-multiply-two-matrices/">https://www.geeksforgeeks.org/cpp-program-to-multiply-two-matrices/</a>

C++ Program on Multiplication of Two Matrices

In this video, we will create a C++ Program on how to check if Two Strings are Anagrams or not. What are anagrams? Anagrams are words or phrases you spell by rearranging the letters of another word or phrase. For examples: String 1: aabc String 2: abca Output: True String 1: act String 2: cat Output: True String 1: below String 2: elbow Output: True Here in this video, we cover three different methods to check it: 1. Sorting: Sort both strings. Compare the sorted strings 2. Hashing: In this method, two arrays are used.&nbsp; - Iterate through every character of both strings and increment the count of characters in the corresponding count arrays.&nbsp; - Compare count arrays.&nbsp; - If both the count arrays are the same, then it returns true. 3. Using one hash: In this method, we use only one count array instead of two. We can increment the value in the count array for characters in str1 and decrement for characters in str2. At last, if all count values are equal to 0, then the two strings are anagrams of each other.&nbsp; Apart from that, we will see the time and space complexity of all mentioned methods as well. CPP program to check if 2 strings are anagram of each other or not: <a href="https://www.geeksforgeeks.org/cpp-program-to-check-whether-two-strings-are-anagram-of-each-other/">https://www.geeksforgeeks.org/cpp-program-to-check-whether-two-strings-are-anagram-of-each-other/</a>

JavaScript Program to Check if Two Strings are Anagrams

In this video, we will write a C++ program to return the maximum occurring character in an input string.&nbsp; For Example: Input String = GeeksforGeeks Output= e Here we use the “Hashing” method to return the maximum occurring character in an input string.&nbsp; Algorithm: Step 1: First we traverse through the string, we would hash each character into an array of ASCII characters.&nbsp; Step 2: Now we construct a character count array from the input string, and store the occurrence value. Step 3: Print the index of the maximum value in the count array. Example:&nbsp; Input = Hellooo Output = o Dry Run:&nbsp; count['H'] = 1 count['e] = 1 count['l'] = 2 count[‘o’]= 3 ASCII characters are 256, so we use our Hash array size as 256. But if we know that our input string will have characters with the value from 0 to 127 only, we can limit the Hash array size to 128. Similarly, based on extra info known about input string, the Hash array size can be limited to 26Related Article : &nbsp;<a href="https://www.geeksforgeeks.org/return-maximum-occurring-character-in-the-input-string/">https://www.geeksforgeeks.org/return-maximum-occurring-character-in-the-input-string/</a>

C++ Program to Return Maximum occurring Character in an Input String

Given an integer, write a function that returns true if the given number is palindrome, else false. For example, 12321 is palindrome, but 1451 is not palindrome.&nbsp; Let the given number be num. A simple method for this problem is to first reverse digits of num, then compare the reverse of num with num. If both are same, then return true, else false.Palindrome Number: <a href="https://www.geeksforgeeks.org/check-if-a-number-is-palindrome/">https://www.geeksforgeeks.org/check-if-a-number-is-palindrome/</a>

Palindrome Number

In this video, we will see a C++ program to find the GCD of two numbers. Basically, GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them.For examples: Input: GCD of 98 and 56 is 14 Num 1 = “98” Num 2 = “56”Then 98 = 2x7x7 56= 2x2x2x7Common factor = 2x7 GCD = 14To find GCD of two numbers we use three different methods: 1) Using loop 2) Using recursive function 3) Using In-built [ __GCD()] functionApart from that, we will see the time and space complexity of each and every method. Here, - Time and space complexity will be O(N) &amp; O(1) in looping method. - Using recursive function time and space complexity will be O(log(N)) &amp; O(1) respectively. - And Using In-built [ __GCD()] function the time and space complexity will be O(log(N)) &amp; O(1).Program to find GCD of two numbers:<a href=" https://www.geeksforgeeks.org/c-program-find-gcd-hcf-two-numbers/"> https://www.geeksforgeeks.org/c-program-find-gcd-hcf-two-numbers/</a>

C++ Program to Find GCD

Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet. Examples : The quick brown fox jumps over the lazy dog ” is a Pangram [Contains all the characters from ‘a’ to ‘z’]&nbsp; “The quick brown fox jumps over the dog” is not a Pangram [Doesn’t contain all the characters from ‘a’ to ‘z’, as ‘l’, ‘z’, ‘y’ are missing]Pangram Checking:<a href="https://www.geeksforgeeks.org/pangram-checking/">https://www.geeksforgeeks.org/pangram-checking/</a>

Pangram Checking

We are given a row-wise sorted matrix of size r*c, we need to find the median of the matrix given. It is assumed that r*c is always odd. Examples:Input : 1 3 5 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 2 6 9 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 3 6 9Output : Median is 5If we put all the values in a sorted&nbsp; array A[] = 1 2 3 3 5 6 6 9 9)Input: 1 3 4 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;2 5 6 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;7 8 9Output: Median is 5Find median of a row-wise sorted Matrix :<a href="https://www.geeksforgeeks.org/find-median-row-wise-sorted-matrix">https://www.geeksforgeeks.org/find-median-row-wise-sorted-matrix</a>

Find median of a row-wise sorted Matrix

A function is a set of statements that take inputs, do some specific computation, and produce output. The idea is to put some commonly or repeatedly done tasks together and make a function so that instead of writing the same code again and again for different inputs, we can call the function. In simple terms, a function is a block of code that only runs when it is called.<ul><li style="text-align:justify;">Functions help us in reducing code redundancy. If functionality is performed at multiple places in software, then rather than writing the same code, again and again, we create a function and call it everywhere. This also helps in maintenance as we have to change at one place if we make future changes to the functionality.</li><li style="text-align:justify;">Functions make code modular. Consider a big file having many lines of code. It becomes really simple to read and use the code if the code is divided into functions.</li><li style="text-align:justify;">Functions provide abstraction. For example, we can use library functions without worrying about their internal work.</li></ul>&nbsp;Related Article : <a href="https://www.geeksforgeeks.org/functions-in-cpp/">https://www.geeksforgeeks.org/functions-in-cpp/</a>

Functions in C++

Welcome to our algorithm tutorial where we explore how to find the Least Common Multiple (LCM) of two numbers efficiently in C++! Whether you're a beginner in programming or an experienced coder looking for optimized solutions, this tutorial is tailored for you.In this tutorial, we'll delve into the problem of finding the LCM of two numbers, providing clear explanations and step-by-step implementation in C++. We'll cover different approaches and algorithms to calculate the LCM, ensuring that you understand the concepts and can apply them in various scenarios.Join us as we dissect the problem and explore various strategies to find the LCM efficiently. From using the GCD (Greatest Common Divisor) method to prime factorization, we'll discuss different techniques and their implementation in C++.Ready to enhance your understanding of LCM calculation and sharpen your C++ programming skills? Watch the tutorial now and elevate your proficiency in algorithmic problem-solving! For detailed explanations and code implementation, don't forget to check out the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/cpp-program-for-program-to-find-lcm-of-two-numbers/">https://www.geeksforgeeks.org/cpp-program-for-program-to-find-lcm-of-two-numbers/</a>Don't miss out on the opportunity to expand your knowledge and master LCM calculation in C++. Like, share, and subscribe for more tutorials and insights into algorithmic problem-solving. Let's embark on this coding journey together. Happy coding!

C++ code to find LCM of two numbers | Geeksforgeeks

In this video, we will learn how to implement Digital Clock starting from user set time in C++.&nbsp;Here, we will divide this video into 4 sections to learn Digital Clock starting from user set time in C++ 1. What is Digital Clock starting from user set time.&nbsp; 2. Steps to Implement Digital clock&nbsp; 4. Function used to implement Digital clock.&nbsp; 3. Code Implementation&nbsp; It is an application that enables a personal clock that displays the time beginning at a custom determined time. This article shows how to construct such a clock in a 24-hour format with HH:MM:SS slots and start the time from where one would want it to be, and then it advances ahead from there.How to implement Digital Clock starting from user set time in C++ <a href="https://www.geeksforgeeks.org/digital-clock-starting-from-user-set-time-in-cpp/">https://www.geeksforgeeks.org/digital-clock-starting-from-user-set-time-in-cpp/</a>

C++ Program to Illustrate Digital Clock starting from user set time

In this video, we will write C++ Program for GCD of more than two (or array) numbers.&nbsp;Examples: Input : arr[] = {1, 2, 3} Output: 1Input : arr[] = {2, 4, 6, 8} Output: 2Here we covered 3 different methods for GCD of more than two (or array) numbers in C++.<ol><li style="text-align:justify;">Using for loop</li><li style="text-align:justify;">Using Modulo method</li><li style="text-align:justify;">Using recursion</li></ol>1. Using for loop: In this method, we will run a for loop and we will iterate over each element to find the GCD of the previous 2 elements and current elements. After the loop ends, we will have the GCD of the entire array as we calculated it in a set of 2.2. Using the Modulo method: In this method, we will set the first number as our GCD and we will then run a while loop to iterate all the elements in the array. While iterating, if the GCD is a factor of the array element, then we will increment the index. If the GCD is not a factor, we will update the GCD to the modulo of the array element with GCD. &nbsp; 3. Using recursion: In this method, we will have a call to recursive functions with a base case of reaching the end of an array. Here we use the inbuilt GCD function. It will return the GCD of the current element and the next element. &nbsp;C++ program for GCD of more than two numbers:&nbsp; <a href="https://www.geeksforgeeks.org/cpp-program-for-gcd-of-more-than-two-or-array-numbers/">https://www.geeksforgeeks.org/cpp-program-for-gcd-of-more-than-two-or-array-numbers/</a>

C++ Program for GCD of more than two (or array) numbers

In this video, we will write a C++ program to find the diagonal of a rectangle.Formula: Diagonal = length*length + breadth*breadth Example:Input:&nbsp; length = 4 &amp; breadth = 3Output: The Diagonal = 5Dry run:We know that the diagonal of a rectangle is sqrt (a*a+ b*b) So given that here length = 4 and Breadth = 3 =&gt; diagonal of a rectangle is sqrt (4*4+ 3*3) =&gt; sqrt(16+9) =&gt; Sqrt(25) =&gt; So the diagonal of a rectangle is 5.Here in this video, we will calculate the diagonal of a rectangle using a simple formula.C++ Program to Find Diagonal of a Rectangle: <a href="https://www.geeksforgeeks.org/cpp-program-to-find-diagonal-of-a-rectangle/">https://www.geeksforgeeks.org/cpp-program-to-find-diagonal-of-a-rectangle/</a>

C++ Program to Find Diagonal of a Rectangle