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

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)

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Number Theory but also build up problem-solving skills. Given a number n, find out if n can be expressed as a+b, where both a and b are prime numbers. If such a pair exists, return the values of a and b, otherwise return [-1,-1] as an array of size 2. Note: If [a, b] is one solution with a &lt;= b, and [c, d] is another solution with c &lt;= d, and a &lt; c then&nbsp; [a, b] is considered as our answer.ExamplesInput: n = 10
 Output: 3 7
 Explanation: There are two possiblities 3, 7 &amp; 5, 5 are both prime &amp; their sum is 10, but we'll pick 3, 7 as 3 &lt; 5.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/sum-of-prime4751/1">https://practice.geeksforgeeks.org/problems/sum-of-prime4751/1</a>

PROBLEM OF THE DAY : 16/06/2024 | Sum Of Prime

Embark on a mathematical journey through number theory and array manipulation with this insightful guide from GeeksforGeeks. In this illuminating article, you'll explore how to insert the minimum number into an array so that the sum of the array becomes a prime number—an intriguing problem with applications in number theory, algorithms, and optimization.Discover the principles behind prime numbers and learn techniques for efficiently manipulating arrays to achieve the desired sum. Whether you're a mathematician exploring number theory or a programmer optimizing algorithms, mastering the art of array manipulation and prime number analysis is crucial for solving a wide range of computational challenges.Prepare to delve into the world of number theory and algorithmic strategies as you explore detailed explanations and practical examples provided in the article. Unlock the mysteries of prime number manipulation by delving into the accompanying guide on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/insert-minimum-number-array-sum-array-becomes-prime/">https://www.geeksforgeeks.org/insert-minimum-number-array-sum-array-becomes-prime/</a>

Transform to prime | DSA Problem

Embark on a journey through number theory and prime number generation with this insightful guide from GeeksforGeeks on the Sieve of Eratosthenes. In this illuminating article, you'll explore essential concepts and algorithms for efficiently finding all prime numbers up to a specified limit, a fundamental skill for various applications such as cryptography, number theory, and algorithmic problem-solving.Discover the principles behind the Sieve of Eratosthenes algorithm as you delve into its implementation and optimization techniques. Whether you're a coding enthusiast or a seasoned developer, mastering the art of prime number generation using the Sieve of Eratosthenes is essential for optimizing computational resources and solving real-world problems.Prepare to elevate your problem-solving skills and algorithmic proficiency as you explore detailed explanations and practical examples for implementing the Sieve of Eratosthenes. Unlock the full potential of number theory and prime number generation in your projects by delving into the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/sieve-of-eratosthenes/">https://www.geeksforgeeks.org/sieve-of-eratosthenes/</a>

Techfest and the Queue | DSA Problem

Welcome to the daily solving of our PROBLEM OF THE DAY with Siddharth Hazra. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Number System but also build up problem-solving skills. In this problem, we are given, a number n, the task is to find out whether this number is a Smith number or not. A Smith number is a composite number whose sum of digits is equal to the sum of digits of its prime factors. Example : Input: n = 4 Output: 1 Explanation: The sum of the digits of 4 is 4, and the sum of the digits of its prime factors is 2 + 2 = 4. Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/smith-number4132/1">https://practice.geeksforgeeks.org/problems/smith-number4132/1</a>

PROBLEM OF THE DAY : 09/12/2023 | Smith Number

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. In this problem, we are given, an array of n integers. Find the minimum positive number to be inserted in the array, so that the sum of all elements of the array becomes prime. Example :Input: N=5 arr = {2, 4, 6, 8, 12} Output: &nbsp; 5 Explanation:&nbsp; The sum of the array is 32, we can add 5 to this to make it 37 which is a prime numberGive the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/transform-to-prime4635/1">https://practice.geeksforgeeks.org/problems/transform-to-prime4635/1</a> Solution IDE Link: <a href="https://ide.geeksforgeeks.org/online-cpp-compiler/26320440-e4b9-4660-9a87-cf11826e35de">https://ide.geeksforgeeks.org/online-cpp-compiler/26320440-e4b9-4660-9a87-cf11826e35de</a>

PROBLEM OF THE DAY : 08/12/2023 | Transform to prime

In this video, we will write a Python program to print all Prime numbers in n interval.In this video, we have discussed 2 approaches: 1. Using For Loop 2. Using sqrt() functionApproach 1: Using For loop: In this approach, we take user input of 2 integers as the upper and lower limit of the interval. Then we initialize an empty list to store prime numbers. Then we iterate on each integer in the interval and check if it's divisible by any other number except 1 and itself, else we append it to the list of prime numbers. At the end of the loop, we print all prime numbers and count of prime numbers in the interval from the list of prime numbers formed.Approach 2: Using math.sqrt() function: This approach is used to optimize the checking of prime numbers for numbers even in long range also.&nbsp; In this approach, we iterate on each number in the interval and skip if the number is either divisible by 2 or not divisible by all numbers in the range of 3 to the square root of the number. Else, we append the number to the list of prime numbers. At the end of the loop, we print all the prime numbers and the count of prime numbers from the generate list of prime numbers. Python program to print all Prime numbers in an Interval <a href="https://www.geeksforgeeks.org/python-program-to-print-all-prime-numbers-in-an-interval/">https://www.geeksforgeeks.org/python-program-to-print-all-prime-numbers-in-an-interval/</a>

Python program to print all Prime numbers in an Interval

A prime number is a number greater than 1 that can only be divided by 1 and itself without a remainder. For example, prime numbers between 1 and 100 include 2, 3, 5, 7, and so on. To print all prime numbers up to a given number NNN, the algorithm takes input NNN, iterates through numbers from 1 to NNN, and checks each for primality. If a number is prime, it is printed. This method has a time complexity of O(n2/3)O(n^{2/3})O(n2/3) and a space complexity of O(1)O(1)O(1).For instance, given N=10N = 10N=10, the output is 2, 3, 5, 7, while for N=5N = 5N=5, the output is 2, 3, 5. This tutorial explains the step-by-step implementation of this algorithm in C.&nbsp; For more details, please go through - <a href="https://www.geeksforgeeks.org/c-program-to-print-prime-numbers-from-1-to-n/">C Program to Print Prime Numbers From 1 to N</a>

C Program to Print Prime Numbers from 1 to N.

In this video, we will see how to check input number is prime or not in the JAVA programming language.We know that “A prime number is a number that can only be divided by itself and 1 without remainders”. There are some prime numbers from 1 to 100. [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]Some interesting facts about prime numbers: 1. Two is the only even Prime number. 2. Every prime number can be represented in form of 6n+1 or 6n-1 except the prime number 2 and 3, where n is a natural number. 3. Two and Three are only two consecutive natural numbers that are prime.Algorithm to print a prime numbers: Step 1: First, take the numbers. Step 2: Then use a for loop. Step 3: Then check for a number to be a prime number. If it is a prime number, print it.Check if a number is prime or not: <a href="https://www.geeksforgeeks.org/java-program-to-check-if-a-number-is-prime-or-not/">https://www.geeksforgeeks.org/java-program-to-check-if-a-number-is-prime-or-not/</a>

Java Program to Check Prime Number

Use two loops to divide the numbers upto the value of length of string. Increment variable result when the remainder is 0. If the variable result = 1, then print the corresponding character. Program to print characters present at prime indexes in a given string : <a href="https://www.geeksforgeeks.org/program-print-characters-present-prime-index-given-string/">https://www.geeksforgeeks.org/program-print-characters-present-prime-index-given-string/</a>

Program to print characters present at prime indexes in a given string

In this video, we will learn how to find prime numbers using python. This video is divided into 5 sections to find prime numbers.Below is the list of approaches that we will cover in this section:1. What is prime number 2. Brute fore method to check prime number. 3. Optimal solution for finding prime number. 4. Code in python and its time complexity. 5. Prime number using Recursive method.A prime number is a natural number greater than 1, which is only divisible by 1 and itself.First few prime numbers are: 2 3 5 7 11 13 17 19 23. In other words, a number is prime if it is not divisible by any number from 2 to n-1.In the first approach, we will see the brute force method which has the time complexity of O(N^2), and Space Complexity: O(1).&nbsp; Later we will optimize it and decrease its time complexity with O(N^(3/2)).Program to print first n prime numbers: <a href="https://www.geeksforgeeks.org/program-to-print-first-n-prime-numbers/">https://www.geeksforgeeks.org/program-to-print-first-n-prime-numbers/</a>

Python Program to Check Prime Number

In this video, we will see C Program to Check Whether a given number is Prime or not. We know that “A prime number is a number that can only be divided by itself and 1 without remainders”. There are some examples of prime numbers from 1 to 100. [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]Here we use Sqrt of N .The reason is that the smallest and greater than one factor of a number cannot be more than the sqrt of N. And we stop as soon as we find a factor.Some interesting facts about prime numbers:1. Two is the only even Prime number. 2. Every prime number can be represented in form of 6n+1 or 6n-1 except the prime number 2 and 3, where n is a natural number. 3. Two and Three are only two consecutive natural numbers that are prime.Algorithm to print a prime numbers: Step 1: First, take the numbers from user. Step 2: Then use a IF-ELSE condition to check a number is a prime or not. Step 3: If it is a prime number, print it.Time Complexity: O(n1/2) Auxiliary Space: O(1)Program to Check whether a number is prime or not: <a href="https://www.geeksforgeeks.org/c-program-to-check-whether-a-number-is-prime-or-not/">https://www.geeksforgeeks.org/c-program-to-check-whether-a-number-is-prime-or-not/</a>

C Program to Check Whether a Number is Prime or not