Pack put colours in CRM

- **Auteur** : Sathya - **Date** : 17/0/2021 - **Description** :Displays Deal Information, Contact Information, Account status, AMI status in related list with logos - **Video** : https://www.youtube.com/watch?v=E49IggGff5M 1. Install node, npm and zoho extension toolkit to run widgets 2. Create a project in node js command prompt 3. Replace the code in widget.html with the code given below 4. Run the command zet pack 5. In Zoho CRM add Related List to the module 6. Create a widget and associate it to the related list
<!DOCTYPE html>
<html>
  <head>
    <meta charset="UTF-8" />
    <link
      href="https://fonts.googleapis.com/css2?family=Roboto:wght@200&display=swap"
      rel="stylesheet"
    />
    <script
      type="application/javascript"
      src="https://live.zwidgets.com/js-sdk/1.0.6/ZohoEmbededAppSDK.min.js"
    ></script>
    <script>
      function pageLoadFn(data) {
        //Linkedin and Website
        acctID = data.EntityId;
        ZOHO.CRM.API.getRecord({ Entity: "Accounts", RecordID: acct

[tauri] ルーティングを実装 

# === Tauriアプリケーションにルーティングを実装 ===
# 目的: React Router を導入し、複数ページに対応できる構造に変更
# 機能: HashRouter による SPA ルーティング、既存のコンテンツを Home ページに移行
# 影響範囲: App.tsx（ルーティング構造に変更）、App.css（スタイルを Home.css に移動）、新規ページコンポーネント作成
# 必要なパッケージ: react-router-dom

diff --git a/src/App.css b/src/App.css
--- a/src/App.css
+++ b/src/App.css
@@ -1,10 +1,3 @@
-.logo.vite:hover {
-  filter: drop-shadow(0 0 2em #747bff);
-}
-
-.logo.react:hover {
-  filter: drop-shadow(0 0 2em #61dafb);
-}
 :root {
   font-family: Int

ezviz24h.vn 

fix replace phone

Maintenance Mode 


/* ==================================================
MAINTENANCE MODE BG IMAGE--------------------
================================================== */
.alert.callout {
  display: none;
}
/* Maintenance Page */
.maintenance-container {
  display: block;
  max-width: 100%;
}

.maintenance-page {
  background-image: linear-gradient(to bottom, rgba(0, 0, 0, 0.5), rgba(0, 0, 0, 0.5)),
    url('/files/adobestock_1700192769.jpg');
  background-position: center;
  background-size: cover;
}
.maintena

3625. Count Number of Trapezoids II

You are given a 2D integer array points where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane. Return the number of unique trapezoids that can be formed by choosing any four distinct points from points. A trapezoid is a convex quadrilateral with at least one pair of parallel sides. Two lines are parallel if and only if they have the same slope.
/**
 * Count the number of unique trapezoids that can be formed
 * from a set of points on the Cartesian plane.
 *
 * @param {number[][]} points - Array of [x, y] coordinates
 * @return {number} - Number of trapezoids
 */
var countTrapezoids = function(points) {
    const t = new Map(); // Tracks lines grouped by slope (normalized)
    const v = new Map(); // Tracks lines grouped by raw vector direction
    const n = points.length;

    /**
     * Helper to add a line into a map structure.

How iterate a slice in go? 

// https://go.dev/tour/moretypes/16
// https://chatgpt.com/share/69304294-58ac-8006-9cde-961288946986

package main

import "fmt"

var pow = []int{1, 2, 4, 8, 16, 32, 64, 128}

func main() {
	for i, v := range pow {
		fmt.Printf("2**%d = %d\n", i, v)
	}
}

Buttons container stijling 

.block-button-container,
.button-group {
    display: flex;
    flex-wrap: wrap;
    align-items: center;
    gap: 1rem 3rem;

    &.align-center {
        justify-content: center;
    }

    &.align-right {
        justify-content: end;
    }
}

VerneMQ check connections 

# VerneMQ Connection Handling

If you use a vernemq and you need to check to which broker which client is
connected, these commands might help.

Connect to vernemq
```sh
k -n <namespace> exec -it <pod_name_of_vernemq_broker> -- /bin/sh
```

List connections and grep for specific service

```sh
vmq-admin session show --limit 10000 --node --client_id --is_online | grep <service>
```

Enforce a disconnect and re-connect

```sh
vmq-admin session disconnect client-id=<client_id>
```

If you have a ta

magento dump 

mgc db:dump -z -f "dump1.sql.gz" --exclude-table="catalog_product_index_eav_replica" --exclude-table="report_viewed_product_index" --exclude-table="catalog_product_index_price_replica"  --exclude-table="sales_order_data_exporter_cl_index_batches"  --exclude-table="sales_order_data_exporter_cl_index_sequence" --exclude-table="tmp_akeneo_connector_entities_asset" --exclude-table="magento_logging_event_changes" --exclude-table="nn_cache_algolia_reccomend"

Hack PayPal Logs SMTP Leads cPanel host Bank to Bank Transfer Drop Wire Logs WU Transfer Bug... 


Scattered Spider (and allied group Scattered LAPSUS$ Hunters) 🌎 


VERIFIED CARDER SELLING WU,BANK,PAYPAL,CASHAPP,SKRILL TRANSFER BANK LOGS,DUMPS+PIN,CLONED CARDS

Telegram: JeansonTooL SELL CCV CANADA FULLZ FRESH SSN DOB WITH DL LIVE MAIL PASSWORD OFFICE365 PAYPAL

Telegram: JeansonTooL CVV,Fullz,Dumps,PayPal Debit/Credit Card,CashApp, Western Union, Transfer,ATM Clone Cards!!

Telegram: JeansonTooL SELL CVV FULLZ INFO GOOD USA-UK-CA-AU-INTER,PASS VBV/BIN/DOB

Telegram: JeansonTooL : Sell Dump

3623. Count Number of Trapezoids I

You are given a 2D integer array points, where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane. A horizontal trapezoid is a convex quadrilateral with at least one pair of horizontal sides (i.e. parallel to the x-axis). Two lines are parallel if and only if they have the same slope. Return the number of unique horizontal trapezoids that can be formed by choosing any four distinct points from points. Since the answer may be very large, return it modulo 109 + 7.
/**
 * @param {number[][]} points
 * @return {number}
 */
var countTrapezoids = function(points) {
    const MOD = 1e9 + 7;

    // Step 1: Group points by y-coordinate
    let yGroups = new Map();
    for (let [x, y] of points) {
        if (!yGroups.has(y)) yGroups.set(y, []);
        yGroups.get(y).push(x);
    }

    // Step 2: Count pairs per level
    let pairs = [];
    for (let xs of yGroups.values()) {
        let n = xs.length;
        if (n >= 2) {
            pairs.push((n * (n - 1))

how to run a go program? 

# go run [path_to_entry_point_file_name]
# example
go run main.go

#example 2
go run basics/for_loop.go

re:Invent 

{
	"Version": "2012-10-17",
	"Statement": [
		{
			"Sid": "BlockedServiceActions",
			"Effect": "Deny",
			"Action": [
				"ec2:PurchaseReservedInstancesOffering",
				"ec2:PurchaseScheduledInstances",
				"elasticache:PurchaseReservedCacheNodesOffering",
				"events:CreatePartnerEventSource",
				"glacier:AbortVaultLock",
				"glacier:CompleteVaultLock",
				"glacier:InitiateVaultLock",
				"glacier:PurchaseProvisionedCapacity",
				"glacier:SetVaultAccessPolicy",
				"iotevents:PutLoggingOptio

2141. Maximum Running Time of N Computers

You have n computers. You are given the integer n and a 0-indexed integer array batteries where the ith battery can run a computer for batteries[i] minutes. You are interested in running all n computers simultaneously using the given batteries. Initially, you can insert at most one battery into each computer. After that and at any integer time moment, you can remove a battery from a computer and insert another battery any number of times. The inserted battery can be a totally new battery or a battery from another computer. You may assume that the removing and inserting processes take no time. Note that the batteries cannot be recharged. Return the maximum number of minutes you can run all the n computers simultaneously.
/**
 * Calculates the maximum running time for `n` computers
 * given a set of batteries with different capacities.
 *
 * @param {number} n - Number of computers
 * @param {number[]} batteries - Array of battery capacities
 * @return {number} - Maximum possible running time
 */
var maxRunTime = function(n, batteries) {
    // Step 1: Compute the total available power across all batteries
    let totalPower = 0;
    for (let power of batteries) {
        totalPower += power;
    }

    // Step 2:

📋 Octal - Use Case - Linux Permissions 

### 1\. La Logique : Pourquoi l'Octal ?

Linux gère les droits d'accès par groupes de **3 types d'actions**.
Or, $2^3 = 8$. L'octal (base 8, chiffres de 0 à 7) est donc mathématiquement parfait pour décrire ces états.

Chaque fichier a 3 niveaux de permission qui correspondent à 3 bits :

1.  **R**ead (Lecture) : Le bit de poids fort ($2^2 = 4$)
2.  **W**rite (Écriture) : Le bit du milieu ($2^1 = 2$)
3.  **X**ecute (Exécution) : Le bit de poids faible ($2^0 = 1$)

Si le bit est à 1, l'action est

Decentralizing accessibility 

Shift left vs Shift right: When to use which? https://www.browserstack.com/guide/shift-left-vs-shift-right 

Accessibility decentralization, “shifting left” must happen at every level of the product development (and digital accessibility) cycle. It should not be in a form of integrating accessibility checker somewhere in the CI pipeline, it should be a focus within design, development, project management and copywriting teams.

Make accessibility a part of something that already exists. Do not e