print(eval(input("")))

#include <stdio.h>

int check_dual_int(int arr[], int length) {
    for (int i = 0; i < length; i++) {
        for(int j=i+1; j< length; j++) {
            if(arr[i] == arr[j]) {
                return 1;
            }
        }
    }
    return 0;
}

int main() {
    int arr[] = {1, 2, 3, 1};
    int length = sizeof(arr) / sizeof(arr[0]);

    if(check_dual_int(arr, length) == 1) {
        printf("True");
    } else {
        printf("False");
    };
    return 0;
}

print(f"{"Boom":_^20}")

Given an array of positive integers arr[] of size n, the task is to find second largest distinct element in the array.
Note: If the second largest element does not exist, return -1.

Given an array of integers arr[], the task is to move all the zeros to the end of the array while maintaining the relative order of all non-zero elements.

Given an array arr[], the task is to reverse the array. Reversing an array means rearranging the elements such that the first element becomes the last, the second element becomes second last and so on.

Given an array of integers arr[] of size n, the task is to rotate the array elements to the left by d positions.

Given an array arr[] of size n, the task is to print the lexicographically next greater permutation of the given array. If there does not exist any greater permutation, then find the lexicographically smallest permutation of the given array.

Let us understand the problem better by writing all permutations of [1, 2, 4] in lexicographical order

[1, 2, 4], [1, 4, 2], [2, 1, 4], [2, 4, 1], [4, 1, 2] and [4, 2, 1]

If we give any of the above (except the last) as input, we need to find the next one in sequence. If we give last as input, we need to return the first one.

name = "Chiku"
age = 21
print(f"Name: {name}, Age: {age}")
# Use code and learn.

var = 100
print(f"var={var}")
print(f"{var = }")
# Use code and learn.

decimal_number = 1234.5678
percent = 0.5678
print(f"Decimal: {decimal_number:.2f}")
print(f"Percent: {percent:.2%}")
# Use code and learn.

big_number = 1000000
print(f"Big number: {big_number:,}")
# Use code and learn.

import datetime
now = datetime.datetime.now()
print(f"Date: {now:%x}")
print(f"Date and time: {now:%c}")
print(f"Time: {now:%H:%M:%S}")
# Use code and learn.

path = fr"C:\Users\{user}\Documents"
# Use code and learn.
# Do not use in big project, use this format for fun only

text = "Chiku"
print(f"{text:>20}")  # Right align
print(f"{text:^20}")  # Center align
print(f"{text:<20}")  # Left align
# Use code and learn.

class Text:
    def __init__(self, text):
        self.text = text

    def __format__(self, format_spec):
        if format_spec == "upper":
            return self.text.upper()
        elif format_spec == "lower":
            return self.text.lower()
        elif format_spec == "count":
            return str(len(self.text))
        else:
            raise ValueError(f"Invalid format specifier: {format_spec}")

text = Text("Chiku")
print(f"{text:upper}")
print(f"{text:lower}")
print(f"{text:count}")
# Use code and learn.

Given an array arr[] consisting of n integers, the task is to find all the array elements which occurs more than floor(n/3) times.

Note: The returned array of majority elements should be sorted.

First you need python installed in your local machine to create virtual environment.
Download Python from Here

cd D:/code/

python --version # Type this and hit enter to verify the python version


# Now use these commands
python -m venv .env

.\env\Scripts\activate

.\env\Scripts\Activate.ps1

source \.env\bin\activate

Set-ExecutionPolicy -Scope Process -ExecutionPolicy Bypass