Snippets Collections
Sub AutofitAllColumns()

Cells.EntireColumn.AutoFit

End Sub
Jika tarik tunai di ATM šNšˆ gagal (uang tidak keluar) saldš—¼ berkurang, hubungi šNšˆ melalui Whatsš€š©š© +62 8214443946 atau 15OOO46. jangan panik, segera catat nomor mesin ATM, lokasi, waktu transaksi, Dan laporkan ke officer šNšˆ atau via aplikasi setelah verifikasi sistem saldo akan dikembalikan.
Print(Hello wlcome to the st clares senior secondary school agra cantt)
ffmpeg -i cancion.mp3 -filter:a loudnorm=print_format=summary -f null -
# myscript.py
def greet():
    print("Hello from greet!")

if __name__ == "__main__":
    print("Running directly!")
    greet()
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Mobile App Development Abu Dhabi | DXB APPS</title>
    <meta name="description" content="DXB APPS is a leading mobile app development company in Abu Dhabi offering innovative iOS and Android solutions tailored for businesses in UAE.">
    <meta name="keywords" content="mobile app development abu dhabi, mobile application development abu dhabi, app development abu dhabi, dxb apps, ios app development abu dhabi, android app development abu dhabi, app developers abu dhabi">
</head>

<body>

    <p>
        In today’s digital-first world, businesses in the UAE are rapidly embracing mobile solutions to stay competitive. 
        <strong>DXB APPS</strong> stands out as a trusted name in 
        <a href="https://dxbapps.com/mobile-app-development-abudhabi.php" target="_blank">
            mobile app development Abu Dhabi
        </a>, offering innovative, scalable, and user-centric applications tailored to diverse industries. 
        Whether you are a startup or an enterprise, choosing the right mobile app development company in Abu Dhabi 
        can define your digital success—and that’s where DXB APPS excels.
    </p>

    <h2>Why Mobile App Development in Abu Dhabi is Booming</h2>
    <p>
        Abu Dhabi is becoming a hub for digital transformation, with businesses investing heavily in 
        mobile application development Abu Dhabi to enhance customer engagement and streamline operations. 
        The growing demand for digital platforms has fueled the rise of professional app developers Abu Dhabi, 
        making it essential to partner with a company that understands both technology and market dynamics.
    </p>

    <p>
        DXB APPS leverages cutting-edge technologies, industry insights, and a client-focused approach 
        to deliver high-performance mobile applications that meet modern business needs.
    </p>

    <h2>DXB APPS – Your Partner for App Development in Abu Dhabi</h2>
    <p>
        When it comes to app development Abu Dhabi, DXB APPS offers end-to-end solutions—from concept and design 
        to development and deployment. The company focuses on delivering apps that are not only visually appealing 
        but also functionally robust and scalable.
    </p>

    <h3>Key Services Offered:</h3>
    <ul>
        <li>Custom mobile app development</li>
        <li>UI/UX design and prototyping</li>
        <li>App testing and quality assurance</li>
        <li>App maintenance and support</li>
    </ul>

    <p>
        As a leading mobile app development company in Abu Dhabi, DXB APPS ensures every project aligns 
        with business goals and user expectations.
    </p>

    <h2>Expertise in iOS and Android App Development Abu Dhabi</h2>

    <h3>iOS App Development Abu Dhabi</h3>
    <p>
        DXB APPS specializes in iOS app development Abu Dhabi, creating high-quality applications for Apple devices. 
        Their team ensures seamless performance, elegant design, and strict adherence to Apple’s standards, 
        helping businesses target premium audiences.
    </p>

    <h3>Android App Development Abu Dhabi</h3>
    <p>
        With expertise in android app development Abu Dhabi, DXB APPS builds flexible and scalable apps 
        for a wide range of Android devices. These apps are optimized for performance, security, and user experience, 
        making them ideal for reaching a broader market.
    </p>

    <h2>What Makes DXB APPS Stand Out Among App Developers Abu Dhabi?</h2>
    <ol>
        <li><strong>Client-Centric Approach:</strong> Tailored solutions based on business requirements</li>
        <li><strong>Experienced Team:</strong> Skilled developers with expertise in modern technologies</li>
        <li><strong>Innovative Solutions:</strong> Use of AI, IoT, and advanced frameworks</li>
        <li><strong>Timely Delivery:</strong> Efficient project management ensuring deadlines are met</li>
        <li><strong>Affordable Pricing:</strong> Cost-effective solutions without compromising quality</li>
    </ol>

    <h2>Benefits of Choosing DXB APPS for Mobile Application Development Abu Dhabi</h2>
    <p>
        Partnering with DXB APPS for 
        <a href="https://dxbapps.com/mobile-app-development-abudhabi.php" target="_blank">
            mobile application development Abu Dhabi
        </a> offers several advantages:
    </p>

    <ul>
        <li>Enhanced user engagement through intuitive designs</li>
        <li>Improved business efficiency with custom features</li>
        <li>Scalable apps that grow with your business</li>
        <li>Strong security and data protection measures</li>
    </ul>

    <h2>Conclusion</h2>
    <p>
        If you are searching for reliable mobile app development Abu Dhabi, DXB APPS is a name you can trust. 
        With expertise in mobile application development Abu Dhabi, ios app development Abu Dhabi, and android app development Abu Dhabi, 
        the company delivers innovative solutions tailored to your business needs. 
        As a top mobile app development company in Abu Dhabi, 
        <a href="https://dxbapps.com" target="_blank">DXB APPS</a> continues to empower businesses 
        with cutting-edge digital products that drive growth and success.
    </p>

    <h2>FAQs</h2>

    <h3>1. Why choose DXB APPS for mobile app development in Abu Dhabi?</h3>
    <p>
        DXB APPS offers customized solutions, experienced developers, and innovative technologies, 
        making it a leading choice for mobile app development Abu Dhabi.
    </p>

    <h3>2. Does DXB APPS provide both iOS and Android app development?</h3>
    <p>
        Yes, DXB APPS specializes in both ios app development Abu Dhabi and android app development Abu Dhabi, 
        ensuring comprehensive mobile solutions.
    </p>

    <h3>3. How long does it take to develop a mobile application?</h3>
    <p>
        The timeline depends on the complexity of the project, but DXB APPS ensures timely delivery 
        with efficient project management.
    </p>

    <h3>4. Can DXB APPS handle large-scale app development projects?</h3>
    <p>
        Absolutely. As a professional mobile app development company in Abu Dhabi, DXB APPS has the expertise 
        to manage projects of all sizes.
    </p>

    <h3>5. Do they offer post-launch support?</h3>
    <p>
        Yes, DXB APPS provides ongoing maintenance and support to ensure your app performs smoothly after launch.
    </p>

</body>
</html>
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;
}
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+
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
star

Mon May 04 2026 00:27:11 GMT+0000 (Coordinated Universal Time) https://www.goskills.com/excel/resources/vba-code-library

@iwaschristina #excel-formula

star

Sat May 02 2026 12:47:17 GMT+0000 (Coordinated Universal Time) https://bnicall1946@gmail.com

@Dedekudun1 #bash

star

Sat May 02 2026 12:24:39 GMT+0000 (Coordinated Universal Time) https://medium.com/coinmonks/top-prediction-market-clone-script-providers-9fede127ee6b

@LilianAnderson #predictionmarketclone #clonescriptproviders #web3platformdevelopment #predictionmarketsoftware #blockchainappdevelopment

star

Sat May 02 2026 02:26:39 GMT+0000 (Coordinated Universal Time)

@abhishek2010

star

Fri May 01 2026 23:41:47 GMT+0000 (Coordinated Universal Time)

@vjg #python

star

Fri May 01 2026 04:20:53 GMT+0000 (Coordinated Universal Time)

@siddik

star

Thu Apr 30 2026 09:03:05 GMT+0000 (Coordinated Universal Time) https://www.omegaproxy.com/

@croxymini

star

Thu Apr 30 2026 09:00:04 GMT+0000 (Coordinated Universal Time) https://proxysale.com/

@croxymini

star

Thu Apr 30 2026 08:58:37 GMT+0000 (Coordinated Universal Time) https://www.smartproxy.org/

@croxymini

star

Wed Apr 29 2026 16:18:30 GMT+0000 (Coordinated Universal Time)

@caovillanueva #magento #bdprint

star

Tue Apr 28 2026 15:56:30 GMT+0000 (Coordinated Universal Time)

@Mariem

star

Tue Apr 28 2026 09:11:25 GMT+0000 (Coordinated Universal Time) https://mathibharathi.medium.com/top-10-pancakeswap-clone-script-providers-a4d298adb875

@LilianAnderson #pancakeswapcloneproviders #dexdevelopmentcompanies #defidevelopmentservices #cryptoexchangedevelopment #blockchaindevelopmentcompanies

star

Mon Apr 27 2026 12:13:17 GMT+0000 (Coordinated Universal Time)

@johnsm

star

Sun Apr 26 2026 13:59:11 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:56:00 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:54:15 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:52:45 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:43:30 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:30:22 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:26:21 GMT+0000 (Coordinated Universal Time)

@jenny

star

Sun Apr 26 2026 13:12:49 GMT+0000 (Coordinated Universal Time)

@jenny

star

Fri Apr 24 2026 14:42:41 GMT+0000 (Coordinated Universal Time)

@root1024 ##python #matplotlib #flowofcontrol

star

Fri Apr 24 2026 10:17:32 GMT+0000 (Coordinated Universal Time) https://www.webofsciencejournal.com/

@webofscience

star

Fri Apr 24 2026 10:08:48 GMT+0000 (Coordinated Universal Time) https://www.bestwritemyessay.co.uk/nursing-essay-writing-service/

@Charlotte90

star

Fri Apr 24 2026 06:43:04 GMT+0000 (Coordinated Universal Time) https://www.thecryptoape.com/kraken-clone-script

@Davidbrevis

star

Wed Apr 22 2026 20:38:22 GMT+0000 (Coordinated Universal Time)

@vjg #python

star

Wed Apr 22 2026 13:23:55 GMT+0000 (Coordinated Universal Time)

@Muhammadcodes #javascript

star

Wed Apr 22 2026 09:09:18 GMT+0000 (Coordinated Universal Time) https://www.triphippies.com/mumbai-local-train-map/

@triphippies

star

Mon Apr 20 2026 14:46:09 GMT+0000 (Coordinated Universal Time)

@jrg_300i

star

Sat Apr 18 2026 16:51:16 GMT+0000 (Coordinated Universal Time)

@marcopinero #javascript

star

Fri Apr 17 2026 17:16:14 GMT+0000 (Coordinated Universal Time)

@jrg_300i

star

Fri Apr 17 2026 09:47:05 GMT+0000 (Coordinated Universal Time) https://www.innblockchain.com/academy/cryptocurrency-exchange-business-model

@adamspjo

star

Wed Apr 15 2026 10:39:40 GMT+0000 (Coordinated Universal Time) https://www.rginfotech.com/industries/travel-app-development/

@kishanrg

star

Wed Apr 15 2026 09:35:10 GMT+0000 (Coordinated Universal Time) https://www.innblockchain.com/cryptocurrency-exchange-development

@adamspjo

star

Wed Apr 15 2026 07:48:14 GMT+0000 (Coordinated Universal Time) https://www.inoru.com/ico-marketing-services

@aliasceasar #ico #icomarketing #icomarketingservices

star

Mon Apr 13 2026 09:25:50 GMT+0000 (Coordinated Universal Time) https://superuser.com/questions/290093/difference-between-etc-crontab-and-crontab-e

@teressider

star

Mon Apr 13 2026 09:24:23 GMT+0000 (Coordinated Universal Time) https://www.coinexra.com/cryptocurrency-exchange-script

@janeaurel #c#

star

Fri Apr 10 2026 10:27:02 GMT+0000 (Coordinated Universal Time) https://www.hivelance.com/sports-betting-clone-script

@stevejohnson #sportsbetting clone script

star

Thu Apr 09 2026 15:45:26 GMT+0000 (Coordinated Universal Time)

@yasvanthM

star

Thu Apr 09 2026 15:12:28 GMT+0000 (Coordinated Universal Time)

@yasvanthM

star

Thu Apr 09 2026 15:10:55 GMT+0000 (Coordinated Universal Time)

@yasvanthM

star

Thu Apr 09 2026 15:08:37 GMT+0000 (Coordinated Universal Time)

@yasvanthM

star

Sat Apr 04 2026 04:41:08 GMT+0000 (Coordinated Universal Time)

@v1ral_ITS

star

Sat Apr 04 2026 02:36:35 GMT+0000 (Coordinated Universal Time)

@v1ral_ITS

star

Sat Apr 04 2026 02:36:01 GMT+0000 (Coordinated Universal Time)

@v1ral_ITS

star

Thu Apr 02 2026 10:50:36 GMT+0000 (Coordinated Universal Time) https://www.firebeetechnoservices.com/blog/nft-marketplace-development

@Franklinclas #nftmarketplace #nftmarketplace development #nftplatform development

star

Thu Apr 02 2026 09:16:33 GMT+0000 (Coordinated Universal Time) https://www.addustechnologies.com/defi-wallet-development-company

@brucebanner #defi #wallet #development

star

Thu Apr 02 2026 08:33:41 GMT+0000 (Coordinated Universal Time)

@shubhangi.b

star

Wed Apr 01 2026 10:04:23 GMT+0000 (Coordinated Universal Time) https://www.addustechnologies.com/crypto-future-trading-software-development

@brucebanner #crypto #exchange #business

Save snippets that work with our extensions

Available in the Chrome Web Store Get Firefox Add-on Get VS Code extension