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

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

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

ML & Data Science

Interview Corner

CS Subjects

Software and Tools

School Learning

Practice Coding Problems

Tutorials

DSA / Placements

Development

Cloud / DevOps

All Courses

Courses

JavaScript

Languages

GfG 160

GfG 360

Core Subjects

Interview Questions

Interview Puzzles

Aptitude and Reasoning

Interview Preparation

Data Analytics

Complete Data Science

Full-Stack Web Dev

Software Testing

CyberSecurity

Dev Skills

Computer Fundamentals

AI Tools

MS Excel & Google Sheets

MS Word & Google Docs

Tools

Maths For Computer Science

Tracks

In this video, we will see a how-to find Sum of the digits of a given number. Let's understand this concept with the help of examples:Suppose an Input : n = 123 = 1+2+3 = Output: 6Now take another example and Input n = 1990 = 1+9+9+0 = Output : 19General Algorithm for the sum of digits in a given number:Step 1: Get the number. Step 2: Declare a variable to store the sum and set it to 0. Step 3: Repeat the next two steps till the number is not 0. Step 4: Get the rightmost digit of the number with help of the remainder ‘%’ operator by dividing it by 10 and add it to sum. Step 5: Divide the number by 10 with help of ‘/’ operator to remove the rightmost digit. Step 6: Print or return the sum.Program for sum of the digits of a given number: <a href="https://www.geeksforgeeks.org/program-for-sum-of-the-digits-of-a-given-number/">https://www.geeksforgeeks.org/program-for-sum-of-the-digits-of-a-given-number/</a>

Program to Find the Sum of All Digits of a Number

We have discussed Jarvis’s Algorithm for Convex Hull. The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time. Following is Graham’s algorithm&nbsp; Let points[0..n-1] be the input array. 1) Find the bottom-most point by comparing y coordinate of all points. If there are two points with the same y value, then the point with smaller x coordinate value is considered. Let the bottom-most point be P0. Put P0 at first position in output hull. 2) Consider the remaining n-1 points and sort them by polar angle in counterclockwise order around points[0]. If the polar angle of two points is the same, then put the nearest point first.3 After sorting, check if two or more points have the same angle. If two more points have the same angle, then remove all same angle points except the point farthest from P0. Let the size of the new array be m. 4) If m is less than 3, return (Convex Hull not possible) 5) Create an empty stack ‘S’ and push points[0], points[1] and points[2] to S. 6) Process remaining m-3 points one by one. Do following for every point ‘points[i]’&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;4.1) Keep removing points from stack while orientation of following 3 points is not counterclockwise (or they don’t make a left turn).&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;a) Point next to top in stack&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;b) Point at the top of stack&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;c) points[i]&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 4.2) Push points[i] to S 5) Print contents of SGraham Scan Algorithm : <a href="https://www.geeksforgeeks.org/convex-hull-set-2-graham-scan/">https://www.geeksforgeeks.org/convex-hull-set-2-graham-scan/</a>&nbsp;

Graham Scan Algorithm

Given a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Examples of the first few prime numbers are {2, 3, 5, …} Examples :Input: &nbsp;n = 11 Output: trueInput: &nbsp;n = 15 Output: falseInput: &nbsp;n = 1 Output: falsePrimality Test (Introduction and School Method) : <a href="https://www.geeksforgeeks.org/primality-test-set-1-introduction-and-school-method/">https://www.geeksforgeeks.org/primality-test-set-1-introduction-and-school-method/</a>

Primality Test (Introduction and School Method)

In this video, we will see how to find the roots of a quadratic equation. This language is widely used nowadays for competitive programming. It consists of imperative, object-oriented, and generic programming features.A quadratic equation in variable “x” is an equation of the form, ax2 + bx + c = 0Where, a, b, and c are real numbers and constants, and a ≠ 0. The “roots” of the quadratic are the numbers that satisfy the quadratic equation. There are always two roots for any quadratic equation, although sometimes they may coincide.Depending on the value of A, the nature of roots will change. 1. If A= 0, then the roots will be equal and real. 2. If A &gt; 0, then the roots will be real and distinct. 3. If A &lt; 0, then the roots will be imaginary. If α and β are the roots of the equation, then Sum of roots = -b/a and Product of roots = c/a.Program to find roots of Quadratic Equation: <a href="https://www.geeksforgeeks.org/program-to-find-the-roots-of-quadratic-equation/">https://www.geeksforgeeks.org/program-to-find-the-roots-of-quadratic-equation/</a>

C++ Program to Find Roots of a Quadratic Equation

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 C++, the assignment operator (=) is used to assign values to variables. It is a fundamental operator for storing information in variables. The compound assignment operators, like +=, -=, *=, and others, allow combining operations with assignment. These operators simplify code and make it more efficient by performing multiple operations in one statement.&nbsp; For more details on C++ assignment operators, read the full article <a href="https://www.geeksforgeeks.org/cpp-assignment-operators/">here</a>.

Assignment Operators in C++

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

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

In this video, we will see a C++ Program to Calculate the Power of a Number.To calculate the power of a number we use two different methods:1. User defined function 2. In-built function [pow()]User-defined function: Here we make a Power() which is a user-defined function and calculate the power using a While loop. In-built function [pow()]: Given two numbers base and exponent, pow() function finds x raised to the power of y i.e. xy. pow() is function to get the power of a number, but we have to use #include in C++ to use that pow() function, then two numbers are passed.Syntax: pow(base,exponent); Pow() parameters: 1) Base: the base value 2) Exponent: exponent of the basePow() return value: 1) Result of base exponent 2) 1.0 if exponent is 0. 3) 0.0 if base is 0.Example: pow(4 , 2); Then we will get the result as 4^2, which is 16.Input : x = 2, n = 3 Output : 8Input : x = 7, n = 2 Output : 49Calculate Power of a Number : <a href="https://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/">https://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/</a>

C++ Program to Calculate Power of a Number

In this video, we will see a JavaScript program to find the Factorial of a Number. Basically, the Factorial of a non-negative integer is the multiplication of all integers smaller than or equal to n. For example: Factorial of 6 is 6*5*4*3*2*1 which is 720. Factorial of 5 is 5*4*3*2*1 which is 120.Here we see two different method for calculate factorial of any integer number. 1. Recursive Solution: Factorial can be calculated using following recursive formula. &nbsp;n! = n * (n-1)! n! = 1 if n = 0 or n = 12. Iterative Solution: Factorial can also be calculated iteratively as recursion can be costly for large numbers. Here we have see the iterative approach using both for and while loop for finding factorial.Program to Find Factorial: <a href="https://www.geeksforgeeks.org/program-for-factorial-of-a-number/">https://www.geeksforgeeks.org/program-for-factorial-of-a-number/</a>

JavaScript Program to Find the Factorial of a Number

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

Practice Problems

Linux