#include <iostream>

using namespace std;
int findMax(int n1 , int n2){
    if(n1 > n2){
        return n1;
    }
    return n2;
}

int main() {
     int num1,num2;
     cout << "Enter any two different numbers:"<<endl;
     cin >> num1 >> num2;
     int max = findMax(num1,num2);
     cout << "Maximum of "<< num1 << " and " << num2 << " is " << max;
     return 0;
}

#include <iostream>
using namespace std;

void passByValue(int x) {
    x = 20;  
}

int main() {
    int a = 10;
    cout << "Value of a before function call: " << a << endl;  
    passByValue(a);
    cout << "Value of a after function call: " << a << endl;  
    return 0;
}

#include <iostream>
using namespace std;

void passByReference(int& x) {
    x = 20;  
}

int main() {
    int a = 10;
    cout << "Value of a before function call: " << a << endl; 
    passByReference(a);
    cout << "Value of a after function call: " << a << endl; 
    return 0;
}

cpp
#include <iostream>
using namespace std;

int area(int side) {
    return side * side;
}

int area(int length, int breadth) {
    return length * breadth;
}

int main() {
    int side,length,breadth;
    cout << "Enter a side length of a square:" << endl;
    cin >> side;
    cout << "Enter length and breadth of rectangle:" << endl;
    cin >> length >> breadth;
    cout << "Area of square: " << area(side) << endl;         
    cout << "Area of rectangle: " << area(length, breadth) << endl;    
    return 0;
}

#include <iostream>
using namespace std;

int largestOfThree(int a, int b, int c) {
    int largest = a;
    if(b > largest)
        largest = b;
    if(c > largest)
        largest = c;
    return largest;
}

int main() {
    int first, second, third;
    cout << "Enter any three numbers: ";
    cin >> first >> second >> third;
    
    int large = largestOfThree(first, second, third);
    cout << "Largest number among " << first << ", " << second << ", " 
         << third << " is: " << large << endl;
    
    return 0;
}

#include <iostream>
using namespace std;


void checkCase(char ch) {
    if(ch >= 'a' && ch <= 'z'){
        cout << "Entered character is in lower case" << endl;
    }
    else if(ch >= 'A' && ch <= 'Z'){
        cout << "Entered character is in upper case" << endl;
    }
    else{
        cout << "Invalid character entered" << endl;
    }
}

int main() {
    cout << "Enter any character: ";
    char ch;
    cin >> ch;
    checkCase(ch);
    return 0;
}

#include <iostream>
using namespace std;
int fibonacci(int n) {
    int a = 0, b = 1, temp;
    if (n == 0) return a;
    for (int count = 2; count <= n; count++) {
        temp = b;
        b = a + b;
        a = temp;
    }
    return b;
}
int main() {
    int n;
    cout << "Enter the value of n: ";
    cin >> n;
    cout << n << "th Fibonacci number is: " << fibonacci(n) << endl;
    return 0;
}

#include <iostream>
using namespace std;
int fibonacci(int n) {
    int a = 0, b = 1, temp;
    if (n == 0) return a;
    for (int count = 2; count <= n; count++) {
        temp = b;
        b = a + b;
        a = temp;
    }
    return b;
}
int main() {
    int n;
    cout << "Enter the value of n: ";
    cin >> n;
    cout << n << "th Fibonacci number is: " << fibonacci(n) << endl;
    return 0;
}

#include <iostream>
using namespace std;

int countOccurrences(int number, int targetDigit) {
    int count = 0;
    while (number > 0) {
        int lastDigit = number % 10;
        if (lastDigit == targetDigit) {
            count++;
        }
        number /= 10;
    }
    return count;
}

int main() {
    int number, targetDigit;
    cout << "Enter a number: ";
    cin >> number;
    cout << "Enter the digit to count occurrences of: ";
    cin >> targetDigit;
    int result = countOccurrences(number, targetDigit);
    cout << "The digit " << targetDigit << " appears " << result << " times in " << number << "." << endl;

    return 0;
}

#include <iostream>
using namespace std;

int reverseNumber(int num) {
    int reversedNum = 0;
    while (num > 0) {
        int rem = num % 10;
        reversedNum = reversedNum * 10 + rem;
        num /= 10;
    }
    return reversedNum;
}

int main() {
    int num;
    cout << "Enter the number to reverse: ";
    cin >> num;
    int reversedNum = reverseNumber(num);
    cout << "Reverse of " << num << " is " << reversedNum << endl;
    return 0;
}

#include <iostream>
using namespace std;

bool isPrime(int num) {
    if (num < 2) {
        return false;
    }
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

int main() {
    int num;
    cout << "Enter any number: ";
    cin >> num;
    if (isPrime(num)) {
        cout << num << " is a prime number" << endl;
    } else {
        cout << num << " is not a prime number" << endl;
    }
    return 0;
}

#include <iostream>
#include <cmath> 
using namespace std;

bool isArmstrong(int num) {
    int originalNum = num, sum = 0, digits = to_string(num).length();
    while (num > 0) {
        int rem = num % 10;
        sum += pow(rem, digits); 
        num /= 10;
    }
    return originalNum == sum;
}

int main() {
    int num;
    cout << "Enter any number: ";
    cin >> num;

    if (isArmstrong(num)) {
        cout << num << " is an Armstrong number." << endl;
    } else {
        cout << num << " is not an Armstrong number." << endl;
    }
    return 0;
}

#include <iostream>
using namespace std;

int findMax(int arr[], int size) {
    int maxElem = arr[0];
    for(int i = 1; i < size; i++) {
        if(maxElem < arr[i]) {
            maxElem = arr[i];
        }
    }
    return maxElem;
}

int main() {
    int arr[] = {10, 5, 1, 3, 6};
    int size = sizeof(arr) / sizeof(arr[0]);
    int maxElem = findMax(arr, size);
    cout << "Maximum Element : " << maxElem << endl;
    return 0;
}

#include <iostream>
#include <vector>
using namespace std;

void reverseArray(vector<int>& arr) {
    int n = arr.size();
    for (int i = 0; i < n / 2; i++) {
        swap(arr[i], arr[n - 1 - i]);
    }
}

int main() {
    vector<int> arr = {1, 2, 3, 4, 5, 6};
    reverseArray(arr);

    for (size_t i = 0; i < arr.size(); i++) {
        cout << arr[i] << " ";
    }
    cout << endl;

    return 0;
}

#include <iostream>
using namespace std;

int searchInStr(string str, char ch) {
    for (int i = 0; i < str.length(); i++) {
        if (str[i] == ch) {
            return i;
        }
    }
    return -1;
}

int main() {
    string str = "Java Programming";
    char ch;
    cout << "Enter character to search: ";
    cin >> ch;
    int res = searchInStr(str, ch);
    if (res == -1) {
        cout << "Character not found in the String" << endl;
    } else {
        cout << "Character is at index " << res << endl;
    }
    return 0;
}

#include <iostream>
#include <string>

using namespace std;

int searchInStr(const string &str, char ch, int start, int end) {
    for (int i = start; i <= end; i++) {
        if (str[i] == ch) {
            return i;
        }
    }
    return -1;
}

int main() {
    string str = "Java Programming";
    char ch;
    int start, end;
    
    cout << "Enter character to search: ";
    cin >> ch;
    
    cout << "Enter the range,\n";
    cout << "Enter the start index: ";
    cin >> start;
    cout << "Enter the end index: ";
    cin >> end;
    
    int res = searchInStr(str, ch, start, end);
    
    if (res == -1) {
        cout << "Character not found in the specified range" << endl;
    } else {
        cout << "Character is at index " << res << endl;
    }
    
    return 0;
}

#include <iostream>
using namespace std;

int findMin(int arr[], int size) {
    int min = arr[0];
    for (int i = 1; i < size; i++) {
        if (arr[i] < min) {
            min = arr[i];
        }
    }
    return min;
}

int main() {
    int arr[] = {12, 32, 23, 11, 39};
    int size = sizeof(arr) / sizeof(arr[0]);
    int minNumber = findMin(arr, size);
    cout << "Minimum number in array: " << minNumber << endl;
    return 0;
}

#include <iostream>
using namespace std;

int findMax(int arr[], int size) {
    int max = arr[0];
    for (int i = 1; i < size; i++) {
        if (arr[i] > max) {
            max = arr[i];
        }
    }
    return max;
}

int main() {
    int arr[] = {12, 32, 23, 11, 39};
    int size = sizeof(arr) / sizeof(arr[0]);
    int maxNumber = findMax(arr, size);
    cout << "Maximum number in array: " << maxNumber << endl;
    return 0;
}

#include <iostream>
using namespace std;

int* search(int arr[][3], int rows, int cols, int target) {
    static int result[2]; 
    result[0] = -1;
    result[1] = -1;

    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            if (arr[i][j] == target) {
                result[0] = i;
                result[1] = j;
                return result; 
            }
        }
    }
    return result; 
}

int main() {
    int arr[3][3] = {
        {20, 45, 10},
        {32, 26, 22},
        {47, 98, 37}
    };

    int target;
    cout << "Enter target element: ";
    cin >> target;

    int* result = search(arr, 3, 3, target);
    
    if (result[0] != -1) {
        cout << "Element found at index (" << result[0] << "," << result[1] << ")" << endl;
    } else {
        cout << "Element not found" << endl;
    }

    return 0;
}

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int lastUniqueElementIdx = 0;

        for (int i = 1; i < nums.size(); i++) {
            if (nums[lastUniqueElementIdx] != nums[i]) {
                nums[lastUniqueElementIdx + 1] = nums[i];
                lastUniqueElementIdx++;
            }
        }
        return lastUniqueElementIdx + 1;
    }
};

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int maxProfit = 0;
        for(int i = 0; i < prices.size() - 1; i++) {
            if(prices[i] < prices[i + 1]) {
                int diff = prices[i + 1] - prices[i];
                maxProfit += diff;
            }
        }
        return maxProfit;
    }
};