Pages

Thursday, January 2, 2025

Check whether a number is Prime Number or not

 Check whether a number is Prime Number or not

Mistakes:- 

Theory-wise:- I didn't knew what is Prime Numbers:
**Prime Number:- Divisible by 1 and itself only.
Composite Number:- Divisible by 1 and itself as well as other numbers too.


at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

remove duplicates from sorted array - two pointer approach (leetcode)

  class Solution {     public int removeDuplicates ( int [] nums ) {         // base case: return if array have no el.         if ( nums...

  • Reverse a string using Stack
     import java.util.*; // Push element at the bottom of stack class StackB {          public static String reverseString(String str) {        ...
  • Diamond Pattern problem in C++
      #include <iostream> using namespace std ; // quote- break down bigger problems into smaller problems // Diamond pattern - /* pseu...
  • Binary Search in C++ (Arrays Part)
      #include <iostream> using namespace std ; int binSearch ( int * arr, int n, int key) {     int st = 0 , end = n - 1 ;     w...