Since Binance has proven successful and is the current number one Cryptocurrency Exchange in the entire world, there are also a huge number of startups who either have or will soon have their own version of the Binance Platform through utilizing a binance clone script. This allows users to open a binance clone exchange with similar opportunities for generating income that may be able to be customized much easier or be able to be set up for each individual easily or almost instantaneously!

For more details:https://www.clarisco.com/binance-clone-script 

#include <stdio.h>

// Function to insert element
void insert(int arr[], int *n, int pos, int value) {
    int i;
    if (pos < 1 || pos > *n + 1) {
        printf("Invalid position!\n");
        return;
    }

    for (i = *n; i >= pos; i--) {
        arr[i] = arr[i - 1];
    }

    arr[pos - 1] = value;
    (*n)++;
    printf("Element inserted successfully.\n");
}

// Function to delete element
void deleteElement(int arr[], int *n, int pos) {
    int i;
    if (pos < 1 || pos > *n) {
        printf("Invalid position!\n");
        return;
    }

    for (i = pos - 1; i < *n - 1; i++) {
        arr[i] = arr[i + 1];
    }

    (*n)--;
    printf("Element deleted successfully.\n");
}

// Function to display array
void display(int arr[], int n) {
    int i;
    if (n == 0) {
        printf("Array is empty.\n");
        return;
    }

    printf("Array elements: ");
    for (i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main() {
    int arr[100], n = 0, choice, pos, value, i;

    printf("Enter initial number of elements: ");
    scanf("%d", &n);

    printf("Enter elements:\n");
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    do {
        printf("\n--- MENU ---\n");
        printf("1. Insert\n");
        printf("2. Delete\n");
        printf("3. Display\n");
        printf("4. Exit\n");
        printf("Enter your choice: ");
        scanf("%d", &choice);

        switch (choice) {
            case 1:
                printf("Enter position: ");
                scanf("%d", &pos);
                printf("Enter value: ");
                scanf("%d", &value);
                insert(arr, &n, pos, value);
                break;

            case 2:
                printf("Enter position: ");
                scanf("%d", &pos);
                deleteElement(arr, &n, pos);
                break;

            case 3:
                display(arr, n);
                break;

            case 4:
                printf("Exiting program...\n");
                break;

            default:
                printf("Invalid choice!\n");
        }

    } while (choice != 4);

    return 0;
}

#include <stdio.h>
#define MAX 5

int stack[MAX];
int top = -1;

// Push operation
void push(int value) {
    if (top == MAX - 1) {
        printf("Stack Overflow\n");
        return;
    }
    stack[++top] = value;
    printf("Pushed %d\n", value);
}

// Pop operation
void pop() {
    if (top == -1) {
        printf("Stack Underflow\n");
        return;
    }
    printf("Popped %d\n", stack[top--]);
}

// Display stack
void display() {
    if (top == -1) {
        printf("Stack is empty\n");
        return;
    }
    printf("Stack elements: ");
    for (int i = top; i >= 0; i--) {
        printf("%d ", stack[i]);
    }
    printf("\n");
}

int main() {
    int choice, value;

    do {
        printf("\n--- STACK MENU ---\n");
        printf("1. Push\n2. Pop\n3. Display\n4. Exit\n");
        printf("Enter choice: ");
        scanf("%d", &choice);

        switch (choice) {
            case 1:
                printf("Enter value: ");
                scanf("%d", &value);
                push(value);
                break;

            case 2:
                pop();
                break;

            case 3:
                display();
                break;

            case 4:
                printf("Exiting...\n");
                break;

            default:
                printf("Invalid choice\n");
        }

    } while (choice != 4);

    return 0;
}

#include <stdio.h>
#define MAX 5

int q[MAX];
int front = -1, rear = -1;

// Enqueue
void enqueue(int x){
    if(rear == MAX-1){
        printf("Overflow\n");
        return;
    }
    if(front == -1) front = 0;
    q[++rear] = x;
    printf("Inserted %d\n", x);
}

// Dequeue
void dequeue(){
    if(front == -1 || front > rear){
        printf("Underflow\n");
        return;
    }
    printf("Deleted %d\n", q[front++]);
}

// Display
void display(){
    if(front == -1 || front > rear){
        printf("Queue is empty\n");
        return;
    }
    for(int i=front;i<=rear;i++)
        printf("%d ", q[i]);
    printf("\n");
}

int main(){
    int ch, x;

    do{
        printf("\n1.Enqueue 2.Dequeue 3.Display 4.Exit\n");
        scanf("%d",&ch);

        switch(ch){
            case 1: scanf("%d",&x); enqueue(x); break;
            case 2: dequeue(); break;
            case 3: display(); break;
        }
    }while(ch!=4);

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

// Node structure
struct node {
    int data;
    struct node* next;
};

struct node* head = NULL;

// Insert at beginning
void insertBeg(int x) {
    struct node* newnode = (struct node*)malloc(sizeof(struct node));
    newnode->data = x;
    newnode->next = head;
    head = newnode;
    printf("Inserted at beginning\n");
}

// Insert at end
void insertEnd(int x) {
    struct node* newnode = (struct node*)malloc(sizeof(struct node));
    newnode->data = x;
    newnode->next = NULL;

    if (head == NULL) {
        head = newnode;
    } else {
        struct node* temp = head;
        while (temp->next != NULL)
            temp = temp->next;
        temp->next = newnode;
    }
    printf("Inserted at end\n");
}

// Delete from beginning
void deleteBeg() {
    if (head == NULL) {
        printf("List is empty\n");
        return;
    }
    struct node* temp = head;
    head = head->next;
    free(temp);
    printf("Deleted from beginning\n");
}

// Delete from end
void deleteEnd() {
    if (head == NULL) {
        printf("List is empty\n");
        return;
    }
    struct node *temp = head, *prev;

    if (head->next == NULL) {
        free(head);
        head = NULL;
    } else {
        while (temp->next != NULL) {
            prev = temp;
            temp = temp->next;
        }
        prev->next = NULL;
        free(temp);
    }
    printf("Deleted from end\n");
}

// Display list
void display() {
    struct node* temp = head;
    if (temp == NULL) {
        printf("List is empty\n");
        return;
    }
    printf("Linked List: ");
    while (temp != NULL) {
        printf("%d -> ", temp->data);
        temp = temp->next;
    }
    printf("NULL\n");
}

// Main function
int main() {
    int ch, x;

    do {
        printf("\n--- MENU ---\n");
        printf("1.Insert Begin\n2.Insert End\n3.Delete Begin\n4.Delete End\n5.Display\n6.Exit\n");
        printf("Enter choice: ");
        scanf("%d", &ch);

        switch (ch) {
            case 1:
                printf("Enter value: ");
                scanf("%d", &x);
                insertBeg(x);
                break;

            case 2:
                printf("Enter value: ");
                scanf("%d", &x);
                insertEnd(x);
                break;

            case 3:
                deleteBeg();
                break;

            case 4:
                deleteEnd();
                break;

            case 5:
                display();
                break;

            case 6:
                printf("Exiting...\n");
                break;

            default:
                printf("Invalid choice\n");
        }

    } while (ch != 6);

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

struct node {
    int data;
    struct node* next;
};

struct node* top = NULL;

// Push
void push(int x) {
    struct node* newnode = (struct node*)malloc(sizeof(struct node));
    if (newnode == NULL) {
        printf("Overflow\n");
        return;
    }
    newnode->data = x;
    newnode->next = top;
    top = newnode;
    printf("Pushed %d\n", x);
}

// Pop
void pop() {
    if (top == NULL) {
        printf("Underflow\n");
        return;
    }
    struct node* temp = top;
    printf("Popped %d\n", temp->data);
    top = top->next;
    free(temp);
}

// Display
void display() {
    struct node* temp = top;
    if (temp == NULL) {
        printf("Stack is empty\n");
        return;
    }
    printf("Stack: ");
    while (temp != NULL) {
        printf("%d -> ", temp->data);
        temp = temp->next;
    }
    printf("NULL\n");
}

// Main
int main() {
    int ch, x;

    do {
        printf("\n--- STACK MENU ---\n");
        printf("1.Push\n2.Pop\n3.Display\n4.Exit\n");
        printf("Enter choice: ");
        scanf("%d", &ch);

        switch (ch) {
            case 1:
                printf("Enter value: ");
                scanf("%d", &x);
                push(x);
                break;

            case 2:
                pop();
                break;

            case 3:
                display();
                break;

            case 4:
                printf("Exiting...\n");
                break;

            default:
                printf("Invalid choice!\n");
        }

    } while (ch != 4);

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

// Node structure
struct node {
    int data;
    struct node *left, *right;
};

// Create node
struct node* create(int x) {
    struct node* newnode = (struct node*)malloc(sizeof(struct node));
    newnode->data = x;
    newnode->left = newnode->right = NULL;
    return newnode;
}

// Insert
struct node* insert(struct node* root, int x) {
    if (root == NULL)
        return create(x);

    if (x < root->data)
        root->left = insert(root->left, x);
    else
        root->right = insert(root->right, x);

    return root;
}

// Traversals
void inorder(struct node* root) {
    if (root != NULL) {
        inorder(root->left);
        printf("%d ", root->data);
        inorder(root->right);
    }
}

void preorder(struct node* root) {
    if (root != NULL) {
        printf("%d ", root->data);
        preorder(root->left);
        preorder(root->right);
    }
}

void postorder(struct node* root) {
    if (root != NULL) {
        postorder(root->left);
        postorder(root->right);
        printf("%d ", root->data);
    }
}

// Main
int main() {
    struct node* root = NULL;
    int ch, x;

    do {
        printf("\n--- BST MENU ---\n");
        printf("1.Insert\n2.Inorder\n3.Preorder\n4.Postorder\n5.Exit\n");
        printf("Enter choice: ");
        scanf("%d", &ch);

        switch (ch) {
            case 1:
                printf("Enter value: ");
                scanf("%d", &x);
                root = insert(root, x);
                break;

            case 2:
                printf("Inorder: ");
                inorder(root);
                printf("\n");
                break;

            case 3:
                printf("Preorder: ");
                preorder(root);
                printf("\n");
                break;

            case 4:
                printf("Postorder: ");
                postorder(root);
                printf("\n");
                break;

            case 5:
                printf("Exiting...\n");
                break;

            default:
                printf("Invalid choice!\n");
        }

    } while (ch != 5);

    return 0;
}

#include <stdio.h>
#include <ctype.h>

#define MAX 100

int stack[MAX];
int top = -1;

// Push
void push(int x) {
    stack[++top] = x;
}

// Pop
int pop() {
    return stack[top--];
}

// Evaluate postfix expression
int evaluate(char exp[]) {
    int i = 0, a, b;

    while (exp[i] != '\0') {

        // If operand (digit)
        if (isdigit(exp[i])) {
            push(exp[i] - '0');   // convert char to int
        }
        else {
            b = pop();
            a = pop();

            switch (exp[i]) {
                case '+': push(a + b); break;
                case '-': push(a - b); break;
                case '*': push(a * b); break;
                case '/': push(a / b); break;
            }
        }
        i++;
    }
    return pop();
}

// Main
int main() {
    char exp[100];

    printf("Enter postfix expression: ");
    scanf("%s", exp);

    int result = evaluate(exp);

    printf("Result = %d\n", result);

    return 0;
}

#include <stdio.h>
#define MAX 100

int stack[MAX];
int top = -1;

// Push
void push(int x) {
    stack[++top] = x;
}

// Pop
int pop() {
    return stack[top--];
}

int main() {
    int n, arr[MAX];

    printf("Enter number of elements: ");
    scanf("%d", &n);

    printf("Enter elements:\n");
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
        push(arr[i]);
    }

    for (int i = 0; i < n; i++) {
        arr[i] = pop();
    }

    printf("Reversed list: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}

'''Q1 : 
'''
dict={41:'neha',32:'salma',31:'akash',56:'abhay'}
lst=sorted(dict,reverse=True)
print(lst)
# dict.pop(41)
print(dict)
for i in range(len(dict)):
    print("Your Values are printed as : " ,dict[lst[i]])

Our service is made for people who need simple and real help. We offer thesis to manuscript conversion by working step by step to shorten your thesis, improve clarity, and format it properly so it becomes professional and ready to publish.

Charlotte Sinclair is a senior nursing expert with 10 years of experience in clinical and academic writing. She provides 100% original work at Best Write My Essay UK for medical students. Her style uses simple wording to make complex health topics clear and easy. Every project is built from scratch to stay fresh and unique. She avoids repetitive terms to keep the quality high for every draft. You get a distinct paper that shows her deep skill. Trust her for a professional and new perspective.

whisper cancion.mp3 --model small --language es --output_format srt

netstat -ano | findstr :[port number]

// The output looks something like this   TCP    0.0.0.0:3000           0.0.0.0:0              LISTENING       4692
  TCP    [::]:3000              [::]:0                 LISTENING       4692
  TCP    [::1]:3000             [::1]:53454            TIME_WAIT       0
  TCP    [::1]:3000             [::1]:54970            TIME_WAIT       0
  TCP    [::1]:54969            [::1]:3000             TIME_WAIT       0


kill the culprit:taskkill /PID 4692 /F

Mumbai Train Map is extremely helpful for first-time visitors trying to navigate the city’s complex railway system. It shows all major routes, station connections, and interchange points between Western, Central, and Harbour lines. Trip Hippies recommends studying the Mumbai Train Map before traveling to avoid confusion and save time. The suburban trains are the fastest way to move across Mumbai, especially during peak hours. With clear route understanding, travelers can easily plan their journeys and reach destinations quickly. It is an essential travel tool for exploring Mumbai efficiently and affordably.

Visit Now: https://www.triphippies.com/mumbai-local-train-map/

Puedes descargarlo en una ubicación con mejor internet y copiarlo a tu carpeta local:
en la carpeta: ~/.ollama/models/
  
 Tip extra: Si usas datos móviles, activa el "ahorro de datos" de tu operador y descarga en segundo plano con:
nohup ollama pull qwen2.5-coder:1.5b &
  
curl -fsSL https://ollama.com/install.sh | sh

# Solo 2GB RAM, funciona en casi cualquier laptop:
ollama run qwen3:0.6b

# Equilibrio perfecto entre velocidad y capacidad:
ollama run qwen2.5:3b

# Especializado en código (si programas):
ollama run qwen2.5-coder:1.5b

ollama --version

Ver qué modelos tienes descargados
ollama list	

Descargar un modelo sin ejecutarlo
ollama pull qwen2.5-coder:1.5b

Ejecutar/entrar al chat del modelo
ollama run qwen2.5-coder:1.5b

Eliminar un modelo para liberar espacio
ollama rm qwen2.5-coder:1.5b

Ver modelos en ejecución y uso de RAM
ollama ps

document.addEventListener("visibilitychange", () => {
  if (document.visibilityState === 'visible') {
    console.log("Tab is activated (visible)");
  } else {
    console.log("Tab is deactivated (hidden)");
  }
});

# Laravel, php, vuejs, html, nodejs, javascript, jquery Professional Development Guidelines

## Project Setup

### Stack Preference
- **Framework**: Laravel 11+
- **PHP**: 8.3+
- **Database**: MySQL 8.0+ / PostgreSQL 15+
- **Cache**: Redis
- **Queue**: Redis Horizon
- **Frontend**: Vue.js 3 + Vite / Inertia.js (when SPA needed)
- **Testing**: Pest PHP + PHPUnit

### Project Creation Standards
```bash
composer create-project laravel/laravel project-name
cd project-name
composer require --dev pestphp/pest pestphp/pest-plugin-laravel
php artisan pest:install
```

## Code Style & Conventions

### PHP Standards
- Follow PSR-12 coding standards
- Use strict types: `declare(strict_types=1);`
- Type declarations for all method parameters and return types
- Use readonly classes for DTOs and value objects
- Prefer named arguments for clarity

### File Organization
```
app/
├── Actions/          # Business logic actions
├── DTOs/            # Data Transfer Objects
├── Enums/           # Backed enums
├── Events/          # Domain events
├── Listeners/       # Event listeners
├── Mail/            # Mail classes
├── Models/          # Eloquent models
├── Observers/       # Model observers
├── Policies/        # Authorization policies
├── Providers/       # Service providers
├── Rules/           # Custom validation rules
├── Services/        # External service integrations
├── Traits/          # Reusable traits
└── ValueObjects/    # Value objects
```

## Database & Eloquent

### Models
- Use factory pattern for test data
- Define all relationships explicitly
- Use `$fillable` instead of `$guarded`
- Add proper casts for dates and custom types
- Use query scopes for reusable queries
- Implement API Resources for transformations

### Migrations
- Use descriptive migration names
- Always define `down()` method
- Use `Schema::create()` with `id()` as first column
- Add proper indexes for foreign keys and search columns
- Document complex migrations with comments

### Example Model
```php
<?php

declare(strict_types=1);

namespace App\Models;

use App\Enums\UserStatus;
use Database\Factories\UserFactory;
use Illuminate\Database\Eloquent\Factories\HasFactory;
use Illuminate\Database\Eloquent\Model;
use Illuminate\Database\Eloquent\Relations\HasMany;
use Illuminate\Database\Eloquent\SoftDeletes;

final class User extends Model
{
    /** @use HasFactory<UserFactory> */
    use HasFactory, SoftDeletes;

    protected $fillable = [
        'name',
        'email',
        'password',
        'status',
    ];

    protected $hidden = [
        'password',
        'remember_token',
    ];

    protected function casts(): array
    {
        return [
            'email_verified_at' => 'datetime',
            'password' => 'hashed',
            'status' => UserStatus::class,
        ];
    }

    public function posts(): HasMany
    {
        return $this->hasMany(Post::class);
    }

    public function scopeActive($query): void
    {
        $query->where('status', UserStatus::ACTIVE);
    }
}
```

## Controllers & API

### Controller Standards
- Use resource controllers for CRUD
- Use Form Request classes for validation
- Use API Resources for responses
- Implement proper error handling
- Return consistent JSON structures
- Use route model binding

### API Versioning
- Prefix routes with `/api/v1/`
- Use API Resources for transformations
- Implement proper pagination
- Use ETags for caching

### Example Controller
```php
<?php

declare(strict_types=1);

namespace App\Http\Controllers\Api;

use App\Http\Controllers\Controller;
use App\Http\Requests\StoreUserRequest;
use App\Http\Resources\UserResource;
use App\Models\User;
use Illuminate\Http\JsonResponse;
use Illuminate\Http\Resources\Json\AnonymousResourceCollection;

class UserController extends Controller
{
    public function index(): AnonymousResourceCollection
    {
        return UserResource::collection(
            User::query()->paginate(15)
        );
    }

    public function store(StoreUserRequest $request): JsonResponse
    {
        $user = User::create($request->validated());

        return response()->json([
            'data' => new UserResource($user),
            'message' => 'User created successfully',
        ], 201);
    }
}
```

## Testing

### Pest PHP Standards
- Use `it()` for feature tests
- Use `test()` for unit tests
- Follow AAA pattern (Arrange, Act, Assert)
- Test one thing per test
- Use factories for test data
- Mock external services

### Example Test
```php
<?php

use App\Models\User;
use Illuminate\Foundation\Testing\RefreshDatabase;

uses(RefreshDatabase::class);

it('creates a new user', function () {
    $userData = [
        'name' => 'John Doe',
        'email' => 'john@example.com',
        'password' => 'password123',
    ];

    $response = $this->postJson('/api/v1/users', $userData);

    $response->assertStatus(201)
        ->assertJsonPath('data.name', 'John Doe');

    $this->assertDatabaseHas('users', [
        'email' => 'john@example.com',
    ]);
});
```

## Security

### Requirements
- Use Laravel Sanctum for API authentication
- Implement rate limiting
- Use CSRF protection for web routes
- Validate all user inputs
- Use prepared statements (Eloquent handles this)
- Hash passwords with bcrypt
- Implement proper authorization with Policies

## Performance

### Best Practices
- Use eager loading to prevent N+1 queries
- Cache expensive operations
- Use queue for background jobs
- Optimize database queries
- Use Redis for sessions and cache
- Enable OPcache in production

## Environment Configuration

### Required .env Variables
```env
APP_NAME=
APP_ENV=production
APP_KEY=
APP_DEBUG=false
APP_URL=

DB_CONNECTION=mysql
DB_HOST=127.0.0.1
DB_PORT=3306
DB_DATABASE=
DB_USERNAME=
DB_PASSWORD=

CACHE_DRIVER=redis
QUEUE_CONNECTION=redis
SESSION_DRIVER=redis

REDIS_HOST=127.0.0.1
REDIS_PASSWORD=null
REDIS_PORT=6379

MAIL_MAILER=smtp
MAIL_HOST=
MAIL_PORT=
MAIL_USERNAME=
MAIL_PASSWORD=
MAIL_ENCRYPTION=tls
MAIL_FROM_ADDRESS=
MAIL_FROM_NAME="${APP_NAME}"
```

## Git & Deployment

### Git Standards
- Feature branch workflow
- Conventional Commits for messages
- PR reviews required
- CI/CD pipeline with tests

### Deployment Checklist
- [ ] Run migrations: `php artisan migrate --force`
- [ ] Clear cache: `php artisan optimize:clear`
- [ ] Build assets: `npm run build`
- [ ] Configure supervisor for queues
- [ ] Set up SSL/HTTPS
- [ ] Configure monitoring (Sentry, LogRocket)

## Documentation

### Requirements
- README with setup instructions
- API documentation with OpenAPI/Swagger
- Inline comments for complex logic
- PHPDoc for public methods

---

## Qwen Code Personality & Behavior

### Einstein Mindset
When assisting with Laravel development, embody the following principles:

1. **Relentless Precision** - "God does not play dice with the universe." Never accept sloppy code. Always identify and correct errors, anti-patterns, and potential bugs.

2. **Deep Curiosity** - Question assumptions. Ask "why" before "how". Understand the problem fully before proposing solutions.

3. **Simplicity Through Intelligence** - "Everything should be made as simple as possible, but not simpler." Refactor complex solutions into elegant, maintainable code.

4. **Teaching Mentality** - Explain the reasoning behind corrections. Help the user understand *why* something is wrong, not just *what* is wrong.

5. **Perfectionist Standards** - 
   - Never provide code you wouldn't deploy to production
   - Always suggest tests for new functionality
   - Point out security vulnerabilities immediately
   - Optimize for readability, maintainability, AND performance
   - Catch edge cases before they become bugs

6. **Constructive Criticism** - When you see an error or suboptimal approach:
   - Point it out clearly and directly
   - Explain the potential consequences
   - Provide the corrected solution with reasoning
   - Suggest better alternatives when they exist

7. **First Principles Thinking** - Break down complex problems to their fundamental truths. Build solutions from the ground up based on solid foundations.

### Response Guidelines
- **Be proactive**: Anticipate problems before the user encounters them
- **Be thorough**: Don't skip steps or make assumptions
- **Be educational**: Every interaction should teach something valuable
- **Be honest**: If something is wrong, say it. If you're uncertain, admit it.
- **Be excellent**: Mediocrity is not acceptable. Strive for genius-level solutions.

---

**Note to Qwen Code**: When helping with Laravel projects, always follow these guidelines. Suggest best practices, enforce type safety, and recommend testing for all new features. Channel Einstein's pursuit of perfection and deep understanding in every response.

The format of /etc/crontab is like this:

# m h dom mon dow user      command
*   *  *   *   *  someuser  echo 'foo'
 Save
while crontab -e is per user, it's worth mentioning with no -u argument the crontab command goes to the current users crontab. You can do crontab -e -u <username> to edit a specific users crontab.

Notice in a per user crontab there is no 'user' field.

# m h  dom mon dow  command
*   *   *   *   *   echo 'foo'
 Save
An aspect of crontabs that may be confusing is that root also has its own crontab. e.g. crontab -e -u root will not edit /etc/crontab See Configuring cron.

A Sports Betting Clone Script is a ready-to-deploy software solution that replicates the core functionalities and successful features of market-leading betting platforms. It provides a robust framework that can be fully customized to reflect your brand identity, allowing you to bypass the lengthy and expensive "from-scratch" development process.

As a premier Sports Betting Software Development Company, Hivelance blends industry expertise with cutting-edge Sports betting clone script solution. Our team doesn't just deliver code; we deliver a competitive edge. From initial market analysis to post-launch support, we ensure your sportsbook adheres to global industrial standards and security protocols.

Know More:

Visit – https://www.hivelance.com/sports-betting-clone-script
WhatsApp - +918438595928
Telegram - Hivelance
Mail - sales@hivelance.com
Get Free Demo - https://www.hivelance.com/contact-us

WITH RankedSales AS (
    SELECT 
        category_id, 
        product_name, 
        revenue,
        ROW_NUMBER() OVER (
            PARTITION BY category_id 
            ORDER BY revenue DESC, product_name ASC
        ) as rank_id
    FROM SALES
)
SELECT category_id, product_name, revenue
FROM RankedSales
WHERE rank_id <= 2;

---
  
  SELECT DISTINCT a.user_id
FROM USER_LOGINS a
JOIN USER_LOGINS b 
  ON a.user_id = b.user_id 
  AND a.login_date = b.login_date - INTERVAL '1 day'
ORDER BY a.user_id;

---
  
  SELECT 
    e.name, 
    COALESCE(b.bonus_amount, 0) AS final_bonus
FROM EMPLOYEES e
LEFT JOIN BONUSES b ON e.emp_id = b.emp_id
ORDER BY final_bonus DESC;


---
  
  SELECT MAX(tour_count) AS max_eligible_tours
FROM (
    SELECT 
        f.ID, 
        COUNT(c.ID) AS tour_count
    FROM FAMILIES f
    LEFT JOIN COUNTRIES c 
        ON f.FAMILY_SIZE BETWEEN c.MIN_SIZE AND c.MAX_SIZE
    GROUP BY f.ID
) AS family_eligibility;

WITH RankedReviews AS (
    SELECT 
        p.product_name, 
        r.review_text, 
        r.submit_date,
        ROW_NUMBER() OVER (PARTITION BY p.product_id ORDER BY r.submit_date DESC) as rnk
    FROM reviews r
    JOIN products p ON r.product_id = p.product_id
)
SELECT product_name, review_text, submit_date
FROM RankedReviews
WHERE rnk = 1;

SELECT MAX(eligible_countries)
FROM (
    SELECT f.NAME, COUNT(c.ID) AS eligible_countries
    FROM FAMILIES f
    JOIN COUNTRIES c ON f.FAMILY_SIZE BETWEEN c.MIN_SIZE AND c.MAX_SIZE
    GROUP BY f.ID, f.NAME
) AS family_counts;

SELECT 
    DATE_TRUNC('month', submit_date) AS mth, 
    p.product_name AS product, 
    ROUND(AVG(stars), 2) AS avg_stars
FROM reviews r
JOIN products p ON p.product_id = r.product_id
GROUP BY mth, product
ORDER BY mth ASC, product ASC;

    $ tar xf gtk+-3.24.46.tar.xz               # unpack the sources
    $ cd gtk+-3.24.46                          # change to the topleveldirectory
    $ meson setup _build                       # configure GTK+
    $ meson compile -C _build                  # build GTK+
                                               # Become root if necessary ]
    $ meson install -C _build                  # install GTK+

New-VHD -Path "C:\DiskImages\RAID-B.vhdx" -SizeBytes 5GB -Dynamic

Mount-VHD -Path "C:\DiskImages\RAID-A.vhdx"

Start of code block
New-VHD -Path "C:\DiskImages\RAID-A.vhdx" -SizeBytes 5GB -Dynamic
End of code block

-- RISK342 upi_bioauth_txn_limit
-- DROP TABLE team_kingkong.tpap_risk342_breaches ;

-- CREATE TABLE team_kingkong.tpap_risk342_breaches AS 
INSERT INTO team_kingkong.tpap_risk342_breaches
SELECT txnid
, json_extract_scalar(request, '$.requestPayload.amount') AS txn_amount
, createdon as txn_time
, dl_last_updated as txn_date 
, json_extract_scalar(request, '$.requestPayload.extendedInfo.isBioAuthTxn') AS is_bioauth
, 'upi_bioauth_txn_limit' as rule_name
, 'IsBioAuth = true & amt > 5000' as breach_reason
FROM tpap_hss.upi_switchv2_dwh_risk_data_snapshot_v3
WHERE DATE(dl_last_updated) BETWEEN date'2026-03-01' AND DATE'2026-03-31'
AND json_extract_scalar(response, '$.action_recommended') <> 'BLOCK'
AND json_extract_scalar(request, '$.requestPayload.extendedInfo.isBioAuthTxn') = 'true'
AND CAST(json_extract_scalar(request, '$.requestPayload.amount') AS DOUBLE) > 5000

boto_session = boto3.Session(profile_name="default")
aws_creds = boto_session.get_credentials().get_frozen_credentials()
access_key = aws_creds.access_key
secret_key = aws_creds.secret_key

sc = SparkContext()
spark = (
    SparkSession.builder
    .config("spark.sql.files.ignoreMissingFiles", "true")
    .config("spark.sql.files.ignoreCorruptFiles", "true")
    .config("spark.hadoop.fs.s3a.access.key", access_key)
    .config("spark.hadoop.fs.s3a.secret.key", secret_key)
    .config("spark.hadoop.fs.s3a.impl", "org.apache.hadoop.fs.s3a.S3AFileSystem")
    .appName("Daily Uniques Reports")
    .getOrCreate()
    )

If you are looking for an effective means to manage unorganized data efficiently, Softaken File Organizer Software is a great option. It saves users time and effort by automatically sorting and organizing file folders according to file type, name, size, or date. Because of the software ease of use, even non-technical individuals may utilize it. It guarantees that your data will be readily accessible and organized without the need for human interaction. All things considered, it is a useful tool for anyone trying to simplify their data management procedure and dealing with disorganized files.

(([#"Feed-in Tariff"]*[CSL Percent Share])/100) - [Special Deductions]

(1050/(if Date.IsLeapYear([Monitor Date]) then 366 else 365)) * [Expected Capacity]

if [Monitor.cID] = 21 then 
     if [Monitor Date] <= DateTime.Date(DateTime.FromText("2025-08-15")) then 
          5.00
     else 
         8.54
else 
     if [Monitor.cID] = 271 then 
          if [Monitor Date] <= DateTime.Date(DateTime.FromText("2025-07-06")) then 
               200.00
          else  
               410.000
     else 
          [clientengg.Capacity]

let
    CommencementDate = 
         if [Monitor.cID] = 21 then
              if [Monitor Date] <= DateTime.Date(DateTime.FromText("2025-08-15")) then
                   [clientcontract.FiT Commence Date]
              else
                  DateTime.Date(DateTime.FromText("2025-08-16"))
         else
              if [Monitor.cID] = 271 then
                   if [Monitor Date] <= DateTime.Date(DateTime.FromText("2025-07-06")) then
                        [clientcontract.FiT Commence Date]
                   else
                        DateTime.Date(DateTime.FromText("2025-07-07"))
              else
                  [clientcontract.FiT Commence Date],
    Nameplate_kWp = [Change Capacity],
    FirstYearDeg     = 0.02,
    AnnualDeg        = 0.0055,
    CurrentDate      = [Monitor Date],
    DaysElapsed      = Duration.Days(CurrentDate - CommencementDate),
    YearsElapsed     = DaysElapsed / 365.2425,
    RemainingFactor = 
        if YearsElapsed <= 1 
        then 1 - FirstYearDeg * YearsElapsed
        else 1 - FirstYearDeg - AnnualDeg * (YearsElapsed - 1),

    Expected_kWp = Number.Round(Nameplate_kWp * List.Max({0, RemainingFactor}), 3)
in
    Expected_kWp

/*
  Reed Switch + Servo Example
  ---------------------------

  WIRING NOTES

  1. REED SWITCH
     - One leg of reed switch -> Arduino D2
     - Other leg of reed switch -> GND

     This code uses INPUT_PULLUP, so:
     - switch open   = HIGH
     - switch closed = LOW

     When a magnet comes near the reed switch,
     the switch closes and the pin reads LOW.

  2. SERVO
     - Servo signal wire -> Arduino D9
     - Servo VCC         -> External 5V supply
     - Servo GND         -> GND

  3. IMPORTANT POWER NOTE
     - Do NOT rely on Arduino 5V pin to power the servo for real projects.
     - Use an external 5V supply for the servo.
     - Connect Arduino GND and external supply GND together.

  4. BEHAVIOR
     - No magnet detected -> servo goes to default position
     - Magnet detected    -> servo moves to triggered position
*/

#include <Servo.h>

const int reedPin = 2;
const int servoPin = 9;

Servo sorterServo;

// Adjust these for your mechanism
const int defaultAngle = 60;
const int triggeredAngle = 120;

void setup() {
  pinMode(reedPin, INPUT_PULLUP);

  sorterServo.attach(servoPin);
  sorterServo.write(defaultAngle);

  Serial.begin(9600);
  Serial.println("Reed switch + servo system ready");
}

void loop() {
  int reedState = digitalRead(reedPin);

  // With INPUT_PULLUP:
  // HIGH = no magnet
  // LOW  = magnet detected
  if (reedState == LOW) {
    sorterServo.write(triggeredAngle);
    Serial.println("Magnet detected -> servo to triggered position");
  } else {
    sorterServo.write(defaultAngle);
    Serial.println("No magnet -> servo to default position");
  }

  delay(100);
}

/*
  Touchless ESP32 Switch
  ----------------------

  WIRING NOTES

  1. POWER
     Power bank 5V  -> ESP32 VIN/5V
     Power bank GND -> ESP32 GND

     Power bank 5V  -> Relay VCC
     Power bank GND -> Relay GND

     Power bank 5V  -> IR Sensor VCC
     Power bank GND -> IR Sensor GND

     IMPORTANT:
     All grounds must be common.

  2. IR SENSOR
     IR Sensor OUT -> GPIO 27

     Many IR obstacle sensors are ACTIVE LOW:
     - hand/object detected -> OUT goes LOW
     - no object           -> OUT goes HIGH

     If your sensor behaves the opposite way,
     change SENSOR_ACTIVE_STATE below.

  3. RELAY MODULE
     Relay IN -> GPIO 26

     Many relay modules are ACTIVE LOW:
     - GPIO LOW  -> relay ON
     - GPIO HIGH -> relay OFF

     If your relay behaves the opposite way,
     change RELAY_ACTIVE_STATE below.

  4. RELAY TERMINALS (low-voltage 5V load only)
     Power bank +5V -> COM
     NO             -> load +
     Load -         -> GND

     This makes the load OFF by default and ON when relay activates.

  5. SAFETY
     Use this only for low-voltage 5V devices such as:
     - USB fan
     - small 5V light
     Do NOT use for mains AC.
*/

const int sensorPin = 27;
const int relayPin  = 26;

// Change these if your modules behave differently
const int SENSOR_ACTIVE_STATE = LOW;   // IR detects hand/object
const int RELAY_ACTIVE_STATE  = LOW;   // relay turns ON

bool outputState = false;              // false = OFF, true = ON
bool lastSensorDetected = false;

unsigned long lastTriggerTime = 0;
const unsigned long debounceTime = 500;   // ms

void setRelay(bool on) {
  if (on) {
    digitalWrite(relayPin, RELAY_ACTIVE_STATE);
  } else {
    digitalWrite(relayPin, !RELAY_ACTIVE_STATE);
  }
}

bool sensorDetected() {
  int sensorValue = digitalRead(sensorPin);
  return (sensorValue == SENSOR_ACTIVE_STATE);
}

void setup() {
  Serial.begin(115200);

  pinMode(sensorPin, INPUT);
  pinMode(relayPin, OUTPUT);

  // Start with output OFF
  setRelay(false);

  Serial.println("Touchless switch ready.");
}

void loop() {
  bool detected = sensorDetected();
  unsigned long now = millis();

  // Rising-edge style trigger: toggle only when detection first happens
  if (detected && !lastSensorDetected && (now - lastTriggerTime > debounceTime)) {
    outputState = !outputState;
    setRelay(outputState);

    Serial.print("Sensor triggered. Output is now: ");
    Serial.println(outputState ? "ON" : "OFF");

    lastTriggerTime = now;
  }

  lastSensorDetected = detected;

  delay(20);
}

//
//ESP32 GPIO 5  --------> HC-SR04 TRIG
//ESP32 GPIO 18 <-------- HC-SR04 ECHO through voltage divider

//ESP32 GPIO 13 --------> Servo 1 signal
//ESP32 GPIO 12 --------> Servo 2 signal

//External 5V ----------> Servo 1 red
//External 5V ----------> Servo 2 red
//External 5V ----------> HC-SR04 VCC

//GND ------------------> Servo 1 brown/black
//GND ------------------> Servo 2 brown/black
//GND ------------------> HC-SR04 GND
//GND ------------------> ESP32 GND
//

#include <ESP32Servo.h>

const int trigPin = 5;
const int echoPin = 18;

const int servo1Pin = 13;
const int servo2Pin = 12;

Servo servo1;
Servo servo2;

// Adjust these after testing your mechanism
int closedAngle1 = 10;
int openAngle1   = 80;

int closedAngle2 = 170;
int openAngle2   = 100;

long duration;
float distanceCm;

const float openDistance = 12.0;   // open if object is closer than this
bool lidOpen = false;

float readDistanceCM() {
  digitalWrite(trigPin, LOW);
  delayMicroseconds(3);

  digitalWrite(trigPin, HIGH);
  delayMicroseconds(10);
  digitalWrite(trigPin, LOW);

  duration = pulseIn(echoPin, HIGH, 30000);

  if (duration == 0) {
    return 999;
  }

  return duration * 0.0343 / 2.0;
}

void openLid() {
  servo1.write(openAngle1);
  servo2.write(openAngle2);
  lidOpen = true;
}

void closeLid() {
  servo1.write(closedAngle1);
  servo2.write(closedAngle2);
  lidOpen = false;
}

void setup() {
  Serial.begin(115200);

  pinMode(trigPin, OUTPUT);
  pinMode(echoPin, INPUT);

  servo1.setPeriodHertz(50);
  servo2.setPeriodHertz(50);

  servo1.attach(servo1Pin, 500, 2400);
  servo2.attach(servo2Pin, 500, 2400);

  closeLid();
  delay(500);
}

void loop() {
  distanceCm = readDistanceCM();
  Serial.print("Distance: ");
  Serial.println(distanceCm);

  if (distanceCm < openDistance) {
    openLid();
    delay(3000);   // lid stays open
    closeLid();
    delay(500);
  }

  delay(150);
}

In 2026, businesses are rapidly adopting AI to streamline operations and reduce manual workload. One of the most impactful innovations is the use of AI agents, which can automate repetitive and time-consuming tasks across various departments. From customer support and data processing to lead generation and workflow management, AI agents are transforming how businesses operate.

By leveraging advanced algorithms and real-time data processing, AI agents can handle tasks with high accuracy and speed. This not only improves productivity but also reduces operational costs and human errors. Businesses can focus more on strategic growth while AI handles routine operations.

Key areas where AI agents automate tasks include:

Customer support automation
Sales and lead qualification
Data entry and analysis
Workflow automation
Report generation
Appointment scheduling

Implementing these solutions requires expertise in AI agent development to ensure seamless integration, security, and scalability.

If you’re looking to automate your business processes, partnering with a reliable AI agent development company is essential. Softean offers professional AI agent development services, helping businesses build intelligent, secure, and scalable solutions that drive efficiency and growth.

{
	"blocks": [
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": ":star: What's on in Melbourne this week! :star:"
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "\n\n Good morning Melbourne and hope you all had a fab weekend! :sunshine: \n\n A short week but a fun one in the office as we have a few surprises heading your way :yay: * Please note, we have some changes to our Boost Program this week* "
			}
		},
		{
			"type": "divider"
		},
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": " Wednesday, 1st April :calendar-date-1:",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "\n\n\n:coffee: :muffin: *Xero Café* – Easter Cookies & Choccies\n :coffee: *Barista Special* – Creme Egg Hot Chocolate  \n :easter-chick: *Breakfast*: Join us from *8.30am* for an *Easter Breaky Buffet* in the Wominjeka Breakout Space on Level 3. The menu is in the :thread:  \n :easter_egg:*Easter Egg Hunt*: Join us at *11.00am* for our annual Easter Egg Hunt with a special twist, more info coming soon."
			}
		},
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": "Thursday, 2nd April :calendar-date-2:",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": ":coffee: *Xero Cafe*: Easter Cookies & Choccies \n :rabbit: *Barista Special*–Creme Egg Hot Chocolate   \n :burrito: *Lunch*: No better way to celebrate *National Burrito Day* than grabbing a yummy burrito at *12pm* in the Level 3 Wominjeka Breakout Space  \n :hands: *Aussie all Hands*: Join us at *12.30pm* in the Wominjeka Breakout Space for the Aussie All hands. We would love to see as many of our xeros joining."
			}
		},
		{
			"type": "divider"
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": " What else? :heart: \n\n :tshirt: *Wednesday 1st April*: 2026 Xero Tees collection pop up #1 from 2.00pm on Level 3. \n\n :xero: Feedback on our Boost Offerings? We want to hear more. Let us know what you love by filling out our form <https://docs.google.com/forms/d/e/1FAIpQLScGOSeS5zUI8WXEl0K4WGoQUkmpIHzAjLlEKWBob4sMPhDXmA/viewform|here.>  \n\n Stay tuned to this channel, and make sure you're subscribed to the <https://calendar.google.com/calendar/u/0?cid=Y19xczkyMjk5ZGlsODJzMjA4aGt1b3RnM2t1MEBncm91cC5jYWxlbmRhci5nb29nbGUuY29t|*Melbourne Social Calendar*> :party-wx:"
			}
		}
	]
}