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

Q. Stock Buy and Sell - Multiple Transaction Allowed (Hard)

Given an array prices[] of size n denoting the cost of stock on each day, the task is to find the maximum total profit if we can buy and sell the stocks any number of times.

Note: We can only sell a stock which we have bought earlier and we cannot hold multiple stocks on any day.

Given an array prices[] of length n, representing the prices of the stocks on different days. The task is to find the maximum profit possible by buying and selling the stocks on different days when at most one transaction is allowed. Here one transaction means 1 buy + 1 Sell. If it is not possible to make a profit then return 0.

Note: Stock must be bought before being sold.

Let's make a image captcha generator using python.
You can use it in your website or in telegram bots for user verifications, it generate random text in image so that bots can be recognize..

If you don't know how to make virtual environment, Follow This Post

pip install captcha pillow

from captcha.image import ImageCaptcha
from io import BytesIO
from PIL import Image
import string, random

def random_text():
    text = string.ascii_letters + string.digits
    f_text = ''
    for i in range(6):
        f_text += random.choice(text)
    return f_text

def image_captcha(text: str) -> None:
    captcha: ImageCaptcha = ImageCaptcha(width=400, height=200, font_sizes=(50, 70, 100))

    data: BytesIO = captcha.generate(text)
    image: Image = Image.open(data)
    image.show('Temp')


if __name__ == '__main__':
    image_captcha(random_text())

@NotCoding | @CodesSnippet

Sample image of captcha generator code

Given the heights of n towers and a positive integer k, increase or decrease the height of all towers by k (only once). After modifications, the task is to find the minimum difference between the heights of the tallest and the shortest tower.

Given an array arr[], the task is to find the subarray that has the maximum sum and return its sum.

Given an array arr[] that contains positive and negative integers (may contain 0 as well). Find the maximum product that we can get in a subarray of arr[].

Note: It is guaranteed that the output fits in a 32-bit integer.

Given an array of integers arr[] in a circular fashion. Find the maximum subarray sum that we can get if we assume the array to be circular.

→ To setup and install Tailwindcss in your local machine (pc), you need to follow some steps!!

→ At first to install Tailwindcss you need nodejs installed in your pc, let's intsall nodejs first..
› To install nodejs visit official website of nodejs, download latest version and install it simply by running that executable file.

› If you have Mac or linux then go to Official website and choose nodejs for your machine.

> Verify installation by running command: node -v

cd D:/code/ 

npm install -D tailwindcss

npx tailwindcss init

@tailwind base;
@tailwind components;
@tailwind utilities;

/** @type {import('tailwindcss').Config} */
module.exports = {
  content: ["./dist/*.html"],
  theme: {
    extend: {},
  },
  plugins: [],
}

npx tailwindcss -i ./src/input.css -o ./dist/style.css --watch

@NotCoding | @CodesSnippet