Snippets Collections
def generate_file(file_size_mb, file_name):
    file_size = file_size_mb * 1024 * 1024
    with open(file_name, 'wb') as f:
        f.write(b'\b' * file_size)


generate_file(file_size_mb=2, file_name='test.test')
<!-- Google tag (gtag.js) -->

<script async src="https://www.googletagmanager.com/gtag/js?id=G-HTKNHG"></script>
3
<script>
4
  window.dataLayer = window.dataLayer || [];
5
  function gtag(){dataLayer.push(arguments);}

  gtag('js', new Date());

​
8
  gtag('config', 'G-H34TKNH5G8');

</script>
import mongoose from "mongoose"
// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import {ERC20} from "solmate/tokens/ERC20.sol";

contract MyToken is ERC20 {
    constructor(
        string memory name,
        string memory symbol,
        uint8 decimals,
        uint256 initialSupply
    ) ERC20(name, symbol, decimals) {
        _mint(msg.sender, initialSupply);
    }
}
$ forge create --rpc-url <your_rpc_url> \
    --constructor-args "ForgeUSD" "FUSD" 18 1000000000000000000000 \
    --private-key <your_private_key> \
    --etherscan-api-key <your_etherscan_api_key> \
    --verify \
    src/MyToken.sol:MyToken
# Enable gzip compression for text-based files
http {
   gzip on;
   gzip_types text/plain text/css text/javascript;
}
$(document).ready(function () {
	$('a[data-scroll]').click(function () {
		$('html, body').animate(
			{
				scrollTop: $('.conatct-us').offset().top,
			},
			1000,
		);
	});
});
User Name
anmol.tyagi
Password
|Kzkd#OB;|5jjp?
Notes
account id- satmodo username-
anmol.tyagi-at-877029150039
password-
fYJeCK78H9C5XDaAX92B8+lEv0h0X1+GgC5dt7cYCVU=


login : 
anmol.tyagi
pass: 
Anmol.t2b.tyagi@123

Server 2 branch name:

master-> master-no-cron
staging-> stgaing-no-cron

stop backend process:

sudo kill PID
<!DOCTYPE html>
<html>
<head>
<style>
.button {
  border: none;
  color: white;
  padding: 15px 32px;
  text-align: center;
  text-decoration: none;
  display: inline-block;
  font-size: 16px;
  margin: 4px 2px;
  cursor: pointer;
}

.button1 {background-color: #04AA6D;} /* Green */
.button2 {background-color: #008CBA;} /* Blue */
</style>
</head>
<body>

<button class="button button1">Green</button>
<button class="button button2">Blue</button>

</body>
</html>
<div>
			<h1>GeeksforGeeks</h1>
			<h3>Click on the button to see image</h3>
			<!-- img element without src attribute -->
			<img id="image" src="" />
		</div>
		<button type="button" onclick="show()" id="btnID">
			dixwell
		</button>	
		<script>
			function show() {
				/* Get image and change value 
				of src attribute */
				let image = document.getElementById("image");
				image.src = "495+Dixwell+Avenue.jpeg"
				document.getElementById("btnID")
					.style.display = "none";
			}
		</script>
import { useEffect, useState } from "react";
import { useSupabaseClient } from "@supabase/auth-helpers-react";
import { HeadingLink, MinimalPage, PageHeading, Spinner } from "ui";
import type { Database } from "../../../types";
import dayjs from "dayjs";

const ShiftTable = () => {
  const [usersOnShift, setUsersOnShift] = useState<
    Array<{ user: string; shift_start: string | null }>
  >([]);
  const [loading, setLoading] = useState(true);
  const [error, setError] = useState("");
  const supabaseClient = useSupabaseClient<Database>();

  useEffect(() => {
    const fetchUsersOnShift = async () => {
      setLoading(true);
      try {
        const { data: usersData, error: usersError } = await supabaseClient
          .from("UserLastWorkedOn")
          .select("shift_start, user, users_view (email)")
          .not("shift_start", "is", null);

        if (usersError) {
          setError(usersError.message ?? "Failed to fetch user shift data");
          console.error(usersError);
        }

        const mappedUsers = usersData?.map((user) => {
          const mappedUser: { user: string; shift_start: string | null } = {
            shift_start: user.shift_start,
            user: Array.isArray(user.users_view)
              ? user.users_view[0].email
              : user.users_view?.email ?? user.user,
          };
          return mappedUser;
        });

        setUsersOnShift(mappedUsers ?? []);
      } catch (err) {
        setError("Failed to fetch user shift data");
        console.error(err);
      } finally {
        setLoading(false);
      }
    };

    fetchUsersOnShift();
  }, [supabaseClient]);

  return (
    <MinimalPage
      pageTitle="Shift Table | Email Interface"
      pageDescription="Spot Ship Email Interface | Shift Table"
      commandPrompt
    >
      <div className="w-full">
        <HeadingLink icon="back" text="Home" href="/secure/home" />
      </div>
      <PageHeading text="Spot Ship Shift Table" />
      <div className="flex w-full flex-col">
        {loading ? (
          <Spinner />
        ) : error ? (
          <p className="text-red-500">Error: {error}</p>
        ) : usersOnShift.length ? (
          <table className="mt-4 min-w-full">
            <thead>
              <tr>
                <th className="px-6 py-3 text-left text-xs font-medium uppercase tracking-wider text-gray-500">
                  User Email
                </th>
                <th className="px-6 py-3 text-left text-xs font-medium uppercase tracking-wider text-gray-500">
                  Shift Started
                </th>
              </tr>
            </thead>
            <tbody className="divide-white-200 divide-x ">
              {usersOnShift.map((user, index) => (
                <tr key={index}>
                  <td className=" text-white-500 px-6 py-4 text-sm">
                    {user.user}
                  </td>
                  <td className=" text-white-500 px-6 py-4 text-sm">
                    {dayjs(user.shift_start).format("DD-MM-YYYY | HH:mm")}
                  </td>
                </tr>
              ))}
            </tbody>
          </table>
        ) : (
          <p>No users are currently on shift</p>
        )}
      </div>
    </MinimalPage>
  );
};

export default ShiftTable;
abstract class Shape{
    abstract void draw();
    int size;
    abstract void remove();
}

class Rectangle extends Shape {

    void draw(){
        System.out.println("Drawing a rectangle "+size);
    }
    void remove(){
        System.out.println("removing what we drew");
    }

}


public class Second {
    public static void main(String[] args) {
        Rectangle obj=new Rectangle();
        obj.draw();
        obj.remove();
    }
}
1. git branch
2. git checkout ... (dev oder master)
3. git pull origin dev (master) 
4. git add .(oder separat alle Dateien mit dem Pfad)
5. git commit - m 'dein commit hier'
6. git tag -a TAGNUMMER -m 'tagnummer'
7. git push --tags origin dev (master).
<?xml version="1.0" encoding="UTF-8"?>
<Flow xmlns="http://soap.sforce.com/2006/04/metadata">
    <actionCalls>
        <name>Email_Change_Confirmation</name>
        <label>Email Change Confirmation</label>
        <locationX>176</locationX>
        <locationY>335</locationY>
        <actionName>emailSimple</actionName>
        <actionType>emailSimple</actionType>
        <flowTransactionModel>CurrentTransaction</flowTransactionModel>
        <inputParameters>
            <name>emailBody</name>
            <value>
                <elementReference>EmailChangeTemplate</elementReference>
            </value>
        </inputParameters>
        <inputParameters>
            <name>emailAddresses</name>
            <value>
                <elementReference>$Record__Prior.Email</elementReference>
            </value>
        </inputParameters>
        <inputParameters>
            <name>sendRichBody</name>
            <value>
                <booleanValue>true</booleanValue>
            </value>
        </inputParameters>
        <inputParameters>
            <name>senderAddress</name>
            <value>
                <stringValue>noreply_energy@britishgas.co.uk</stringValue>
            </value>
        </inputParameters>
        <inputParameters>
            <name>senderType</name>
            <value>
                <stringValue>OrgWideEmailAddress</stringValue>
            </value>
        </inputParameters>
        <inputParameters>
            <name>emailSubject</name>
            <value>
                <stringValue>Please activate your new email address</stringValue>
            </value>
        </inputParameters>
    </actionCalls>
    <apiVersion>56.0</apiVersion>
    <environments>Default</environments>
    <interviewLabel>Email Change Confirmation {!$Flow.CurrentDateTime}</interviewLabel>
    <label>Email Change Confirmation</label>
    <processMetadataValues>
        <name>BuilderType</name>
        <value>
            <stringValue>LightningFlowBuilder</stringValue>
        </value>
    </processMetadataValues>
    <processMetadataValues>
        <name>CanvasMode</name>
        <value>
            <stringValue>AUTO_LAYOUT_CANVAS</stringValue>
        </value>
    </processMetadataValues>
    <processMetadataValues>
        <name>OriginBuilderType</name>
        <value>
            <stringValue>LightningFlowBuilder</stringValue>
        </value>
    </processMetadataValues>
    <processType>AutoLaunchedFlow</processType>
    <start>
        <locationX>50</locationX>
        <locationY>0</locationY>
        <connector>
            <targetReference>Email_Change_Confirmation</targetReference>
        </connector>
        <filterFormula>AND(NOT(ISBLANK({!$Record__Prior.Email})),NOT(ISBLANK({!$Record.Email})),ISCHANGED({!$Record.Email}) )</filterFormula>
        <object>Contact</object>
        <recordTriggerType>Update</recordTriggerType>
        <triggerType>RecordAfterSave</triggerType>
    </start>
    <status>Active</status>
    <textTemplates>
        <name>EmailChangeTemplate</name>
        <isViewedAsPlainText>false</isViewedAsPlainText>
        <text>&lt;p style=&quot;text-align: right;&quot;&gt;&lt;br&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;background-color: rgb(255, 255, 255); font-size: 18px; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif; color: rgb(0, 0, 0);&quot;&gt;You changed your email address&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;background-color: rgb(255, 255, 255); font-size: 16px; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif; color: rgb(0, 0, 0);&quot;&gt;Please set up&amp;nbsp;your&amp;nbsp;new password&amp;nbsp;&lt;/span&gt;&lt;span style=&quot;background-color: rgb(255, 255, 255); font-size: 18px; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif; color: rgb(0, 0, 0);&quot;&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;br&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Hello {!$Record.FirstName},&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Thanks&amp;nbsp;for updating your email address to {!$Record.Email}.&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;When you next&amp;nbsp;log in,&amp;nbsp;&lt;/span&gt;&lt;a href=&quot;https://www.britishgas.co.uk/identity&quot; rel=&quot;noopener noreferrer&quot; target=&quot;_blank&quot;&gt;https://www.britishgas.co.uk/identity&lt;/a&gt; &lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;you’ll need to&amp;nbsp;set up a new&amp;nbsp;password to get started.&amp;nbsp;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;strong style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Didn’t request this?&amp;nbsp;&lt;/strong&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;If&amp;nbsp;you didn’t&amp;nbsp;ask us to make&amp;nbsp;this change,&amp;nbsp;please&amp;nbsp;get in touch.&amp;nbsp;&lt;/span&gt;&lt;a href=&quot;https://www.britishgas.co.uk/energy/contact-us&quot; rel=&quot;noopener noreferrer&quot; target=&quot;_blank&quot; style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;https://www.britishgas.co.uk/energy/contact-us&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;strong style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Just a reminder:&lt;/strong&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;ul&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Never share your password or security questions with anyone&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Create passwords that are hard to guess and don’t use personal information&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Use different passwords for each of your online accounts&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Your passwords&amp;nbsp;need:&amp;nbsp;&amp;nbsp;&lt;/span&gt;&lt;ul&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;To be between 8 and 32 characters&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;To&amp;nbsp;contain at least one upper case&amp;nbsp;letter and&amp;nbsp;one lower case letter&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;To contain at least one number&amp;nbsp;&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span style=&quot;font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Symbols are optional, but are a good way to make a password more secure&amp;nbsp;&amp;nbsp;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif;&quot;&gt;Th&lt;/span&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif; color: rgb(68, 68, 68);&quot;&gt;anks for being with us for your energy,&amp;nbsp;&amp;nbsp;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style=&quot;font-size: 11pt; font-family: Calibri, Calibri_EmbeddedFont, Calibri_MSFontService, sans-serif; color: rgb(68, 68, 68);&quot;&gt;Your British Gas Energy Team&amp;nbsp;&lt;/span&gt;&lt;/p&gt;</text>
    </textTemplates>
</Flow>
<ul class="context-menu" data-bind="visible: contextMenu, , style: { left: contextMenuPosition().x + 'px', top: contextMenuPosition().y + 'px' }">
    <li class="context-link" data-bind="click: openInNewTab">
        <span data-bind="attr: { class: 'fa fa-external-link-alt' }"></span>
        <span class="new-tab" data-bind="i18n: 'Open in a new tab'"></span>
    </li>
    <hr>
    <li class="context-link" data-bind="click: copyInClipboard">
        <span data-bind="attr: { class: 'fa fa-copy' }"></span>
        <span class="copy-link" data-bind="i18n: 'Copy in clipboard'"></span>
    </li>
    <li class="context-link" data-bind="click: saveLinkAs">
        <span data-bind="attr: { class: 'fa fa-download' }"></span>
        <span class="save-link" data-bind="i18n: 'Save link as'"></span>
    </li>
    <li class="context-link" data-bind="click: goBack">
        <span data-bind="attr: { class: 'fa fa-arrow-left' }"></span>
        <span class="go-back" data-bind="i18n: 'Back'"></span>
    </li>
    <li class="context-link" data-bind="click: goForward">
        <span data-bind="attr: { class: 'fa fa-arrow-right' }"></span>
        <span class="go-forward" data-bind="i18n: 'Forward'"></span>
    </li>
    <hr>
    <li class="context-link" data-bind="click: refreshPage">
        <span data-bind="attr: { class: 'fa fa-sync' }"></span>
        <span class="refresh-page" data-bind="i18n: 'Refresh'"></span>
    </li>
</ul>
$(document).ready(function ($) {
	$('body .description-form').on(
		'change',
		'.gchoice input[type="radio"]',
		function () {
			if ($(this).is(':checked')) {
				$(this)
					.closest(
						'.gform_page:nth-child(1),.gform_page:nth-child(2),.gform_page:nth-child(3)',
					)
					.find('.gform_next_button')
					.click();
			}
		},
	);
});
//Here is signleton - that means you can create an object of a class outside it

class singleton{
  
  static let shared = singleton()
  init(){} //(Optional to do it or not)
  
  let temp = 5

}

//Usage

viewDidLoad(){
  let num = singleton.shared.temp
  
  //but also you can create object
  let obj = singleton()
  let num = obj.temp
}


//Here is Signleton - that means you cannot create an object of a class outside it

class Singleton{
  
  static let shared = singleton()
  private init(){} //(Optional to do it or not)
  
  let temp = 5

}

//Usage

viewDidLoad(){
  let num = singleton.shared.temp
  
  //but you cannot create object
  //let obj = singleton()
  //let num = obj.temp
}
//replace any element of an array with the provided element(prevoius element will be deleted)
#include <stdio.h>

int main() {

    int size, element, pos;
    
    // Input the size of the array
    printf("Enter size of array: ");
    scanf("%d", &size);

    int arr[size];

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

    // Input the number to be inserted
    printf("Enter the number to insert: ");
    scanf("%d", &element);


    // get the position from user and authenticate it
    printf("enter the position to insert (0 to %d): ", size - 1);
    scanf("%d",&pos);
    if(pos < 0 || pos >= size){
        printf("\nInvalid Position");
        return 1;
        }

    arr[pos] = element;

    // Print the updated array
    printf("Array after insertion:\n");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}
#include<stdio.h>
void main(){
    int n;

    printf("enter number of element in an array: ");
    scanf("%d",&n);

    int arr[n];

    printf("enter elements in array: ");
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    printf("entered array: ");
     for(int i=0;i<n;i++){
        printf("%d",arr[i]);
    }

    printf("\nreversed array: ");
    for(int i=n-1;i>=0;i--){
        printf("%d",arr[i]);
    }
}
#include <stdio.h>

void by_ptr(int *rows, int *cols) {
    int matrix[*rows][*cols];

    printf("Enter the elements of the matrix:\n");
    for (int i = 0; i < *rows; i++) {
        for (int j = 0; j < *cols; j++) {
            scanf("%d", &matrix[i][j]);
        }
    }

    // Transpose the matrix in-place
    for (int i = 0; i < *rows; i++) {
        for (int j = i+1; j < *cols; j++) {
            // Swap matrix elements
            int temp = matrix[i][j];
            matrix[i][j] = matrix[j][i];
            matrix[j][i] = temp;
        }
    }

    // Display the transposed matrix
    printf("Transposed Matrix:\n");
    for (int i = 0; i < *cols; i++) {
        for (int j = 0; j < *rows; j++) {
            printf("%d ", matrix[i][j]);
        }
        printf("\n");
    }
}

int main() {
    int row,cols;
    printf("enter  number of rows: ");
    scanf("%d",&row);
    printf("enter number of columns: ");
    scanf("%d",&cols);
    by_ptr(&row, &cols);
    return 0;
}
//insert element at specific position in an array without deleting the existing element
//size of array will increase and the next element will shift by one position
#include <stdio.h>

int main() {
    int size, i, pos, element;

    // Input the size of the array
    printf("Enter size of array: ");
    scanf("%d", &size);

    // Create an array with given size
    int arr[size];

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

    // Input position and element to insert
    printf("Enter position to insert: ");
    scanf("%d", &pos);
    if (pos < 0 || pos > size) {
        printf("Invalid position.\n");
        return 1;
    }
    
    printf("Enter element to insert: ");
    scanf("%d", &element);

    // Shift elements to the right to make space for the new element
    for (i = size; i > pos; i--) {
        arr[i] = arr[i - 1];
    }

    // Insert the element at the specified position
    arr[pos] = element;

    // Increment the size of the array
    size++;

    // Print the updated array
    printf("Array after insertion:\n");
    for (i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");

    return 0;
}
//insert from end of array and no element is removed(size of array is increased)
#include <stdio.h>

int main() {
    int size, element;

    // Input the size of the array
    printf("Enter size of array: ");
    scanf("%d", &size);

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

    // Shift elements to make space for the new element
    for (int i =  - 1; i >= size; i--) {
        arr[i + 1] = arr[i];
    }

    // Input the number to be inserted
    printf("Enter the number to insert: ");
    scanf("%d", &element);

    // Insert the number at the beginning
    arr[size] = element;

    // Increment the size of the array
    size++;

    // Print the updated array
    printf("Array after insertion:\n");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}
//insert from beginning of array and no element is removed
//size of array is increased by one
#include <stdio.h>

int main() {
    int size, element;

    // Input the size of the array
    printf("Enter size of array: ");
    scanf("%d", &size);

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

    // Input the number to be inserted
    printf("Enter the number to insert: ");
    scanf("%d", &element);

    // Shift elements to make space for the new element
    for (int i = size - 1; i >= 0; i--) {
        arr[i + 1] = arr[i];
    }

    // Insert the number at the beginning
    arr[0] = element;

    // Increment the size of the array
    size++;

    // Print the updated array
    printf("Array after insertion:\n");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}
//insert node at the end of singly circular linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->next=NULL;

    struct node *node2;
    node2=malloc(sizeof(struct node));
    node2->data=98;
    node2->next=NULL;
    head->next=node2;

    node2=malloc(sizeof(struct node));
    node2->data=3;
    node2->next=NULL;
    head->next->next=node2;
    node2->next=head;



    //insert node at the end of singly circular linked list
    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;
    newnode->next=NULL;

    struct node *ptr;
    ptr=head;
    while(ptr->next != head){
        ptr=ptr->next;
    }

    newnode->next=head;
    ptr->next=newnode;

    ptr=head;
    
    while(ptr->next != head){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }
    printf("%d",ptr->data);
}
//insert node at the beginning of singly circular linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->next=NULL;

    struct node *node2;
    node2=malloc(sizeof(struct node));
    node2->data=98;
    node2->next=NULL;
    head->next=node2;

    node2=malloc(sizeof(struct node));
    node2->data=3;
    node2->next=NULL;
    head->next->next=node2;
    node2->next=head;

    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;
    newnode->next=NULL;

    struct node *ptr;
    ptr=head;
    while(ptr->next != head){
        ptr=ptr->next;
    }

    newnode->next=head;
    ptr->next=newnode;

    head=newnode;
    ptr=head;
    
    while(ptr->next != head){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }
    printf("%d",ptr->data);
}
#include<stdio.h>
#include<stdlib.h>

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

int main() {
    struct node *head;
    head = malloc(sizeof(struct node));
    head->prev = NULL;
    head->data = 45;
    head->next = NULL;

    struct node *node2;
    node2 = malloc(sizeof(struct node));
    node2->prev = head;
    head->next = node2;
    node2->data = 98;
    node2->next = NULL;

    struct node *node3;
    node3 = malloc(sizeof(struct node));
    node3->data = 3;
    node3->next = NULL;
    node3->prev = node2;
    node2->next = node3;
    
    struct node *node4;
    node4=malloc(sizeof(struct node));
    node4->data=67;
    node4->prev=node3;
    node4->next=NULL;
    node3->next=node4;


    //reversing doubly linked list
    //(by printing them in reverse and not really reversing list)
    struct node *temp;
    temp=head;
    while(temp->next != NULL){
        temp=temp->next;
    }
    head=temp;
    temp=NULL;

    struct node *ptr;
    ptr = head;
    while (ptr != NULL) {
        printf("%d ", ptr->data);
        ptr = ptr->prev;
    }

}
//delete node from specific position in a doubly linked list
#include<stdio.h>
#include<stdlib.h>

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

int main() {
    struct node *head;
    head = malloc(sizeof(struct node));
    head->prev = NULL;
    head->data = 45;
    head->next = NULL;

    struct node *node2;
    node2 = malloc(sizeof(struct node));
    node2->prev = head;
    head->next = node2;
    node2->data = 98;
    node2->next = NULL;

    struct node *node3;
    node3 = malloc(sizeof(struct node));
    node3->data = 3;
    node3->next = NULL;
    node3->prev = node2;
    node2->next = node3;
    
    struct node *node4;
    node4=malloc(sizeof(struct node));
    node4->data=67;
    node4->prev=node3;
    node4->next=NULL;
    node3->next=node4;


    //delete node from specific position in a doubly linked list
    struct node *temp1,*temp2,*temp3;
    temp1=head;
    temp2=head;
    temp3=head;

    while(temp1->next != NULL){
        temp1=temp1->next;
    }

    int pos=4;
    pos--;
    while(pos != 1){
        temp2=temp2->next;
        pos--;
    }

    pos=3;
    pos--;
    while(pos != 1){
        temp3=temp3->next;
        pos--;
    }

    temp3->next=temp1;
    temp1->prev=temp3;
    temp2->prev=NULL;
    temp2->next=NULL;
    free(temp2);
    temp2=NULL;

    struct node *ptr;
    ptr = head;
    while (ptr != NULL) {
        printf("%d ", ptr->data);
        ptr = ptr->next;
    }
}
//delete node from starting in a doubly linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    struct node *prev;
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->prev=NULL;
    head->data=45;
    head->next=NULL;

    struct node *current;
    current=malloc(sizeof(struct node));
    current->prev=head;
    head->next=current;
    current->data=98;
    current->next=NULL;
    
    struct node *node3;
    node3=malloc(sizeof(struct node));
    head->next->next=node3;
    node3->data=3;
    node3->next=NULL;
    node3->prev=current;



    //delete from starting in a doubly linked list
    struct node *temp;
    temp=head;
    int pos=3;
    pos--;
    while(pos != 1){
        temp=temp->next;
        pos--;
    }

    temp->prev=NULL;
    free(head);
    head=temp;
    temp=NULL; 

    struct node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }
}
//delete node from end of doubly linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    struct node *prev;
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->prev=NULL;
    head->data=45;
    head->next=NULL;

    struct node *current;
    current=malloc(sizeof(struct node));
    current->prev=head;
    head->next=current;
    current->data=98;
    current->next=NULL;
    
    struct node *node3;
    node3=malloc(sizeof(struct node));
    head->next->next=node3;
    node3->data=3;
    node3->next=NULL;
    node3->prev=current;



    //delete node from end in a doubly linked list
    struct node *temp1,*temp2;
    temp1=head;
    temp2=head;

    int pos=3;
    pos--;
    while(pos != 1){
        temp1=temp1->next;
        pos--;
    }
    while(temp2->next != NULL){
        temp2=temp2->next;
    }

    temp1->next=NULL;
    temp2->prev=NULL;
    free(temp2);
    temp2=NULL;

    struct node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }
}
//insert node at specific position in doubly linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    struct node *prev;
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->prev=NULL;
    head->data=45;
    head->next=NULL;

    struct node *current;
    current=malloc(sizeof(struct node));
    current->prev=head;
    head->next=current;
    current->data=98;
    current->next=NULL;
    
    struct node *node3;
    node3=malloc(sizeof(struct node));
    head->next->next=node3;
    node3->data=3;
    node3->next=NULL;
    node3->prev=current;



    //insert at specific position in doubly linked list
    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;

    struct node *temp1,*temp2;
    temp1=head;
    temp2=head;

    while(temp1->next !=  NULL){
        temp1=temp1->next;
    }

    int pos=3;
    pos--;
    while(pos != 1){
        temp2=temp2->next;
        pos--;
    }

    temp2->next=newnode;
    newnode->prev=temp2;
    newnode->next=temp1;
    temp1->prev=newnode;

    struct node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }
}
//insert node at specific position in doubly linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    struct node *prev;
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->prev=NULL;
    head->data=45;
    head->next=NULL;

    struct node *current;
    current=malloc(sizeof(struct node));
    current->prev=head;
    head->next=current;
    current->data=98;
    current->next=NULL;
    
    struct node *node3;
    node3=malloc(sizeof(struct node));
    head->next->next=node3;
    node3->data=3;
    node3->next=NULL;
    node3->prev=current;



    //insert at specific position in doubly linked list
    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;

    struct node *temp1,*temp2;
    temp1=head;
    temp2=head;

    while(temp1->next !=  NULL){
        temp1=temp1->next;
    }

    int pos=3;
    pos--;
    while(pos != 1){
        temp2=temp2->next;
        pos--;
    }

    temp2->next=newnode;
    newnode->prev=temp2;
    newnode->next=temp1;
    temp1->prev=newnode;

    struct node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }
}
//adding node at the end of doubly linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    struct node *prev;
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->prev=NULL;
    head->data=45;
    head->next=NULL;

    struct node *current;
    current=malloc(sizeof(struct node));
    current->prev=head;
    head->next=current;
    current->data=98;
    current->next=NULL;


    //adding node at end of a doubly linked list
    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=3;
    newnode->prev=NULL;
    newnode->next=NULL;

    struct node *ptr;
    ptr=head;
    while(ptr->next != NULL){
        ptr=ptr->next;
    }

    ptr->next=newnode;
    newnode->prev=ptr;
  
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }

}
//adding node at the beginning of a doubly linked list
#include<stdio.h>
#include<stdlib.h>
struct node{
    struct node *prev;
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->prev=NULL;
    head->data=45;
    head->next=NULL;

    struct node *current;
    current=malloc(sizeof(struct node));
    current->prev=head;
    head->next=current;
    current->data=98;
    current->next=NULL;
    
    struct node *node3;
    node3=malloc(sizeof(struct node));
    head->next->next=node3;
    node3->data=3;
    node3->next=NULL;
    node3->prev=current;

    //adding node at beginning of doubly linked list
    //newnode
    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;
    head->prev=newnode;
    newnode->next=head;
    head=newnode;
    newnode=NULL;

    struct node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->next;
    }

}
//single linked list searching of an element
#include<stdio.h>
#include<stdlib.h>
struct node{
    int data;
    struct node *next;
};

void main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->next=NULL;

    struct node *node2;
    node2=malloc(sizeof(struct node));
    node2->data=98;
    node2->next=NULL;
    head->next=node2;

    node2=malloc(sizeof(struct node));
    node2->data=3;
    node2->next=NULL;
    head->next->next=node2;


    //search element in a single linked list
    struct node *ptr;
    ptr=head;
    int target=3;
    int count=1;
    while(ptr->data != target){
        ptr=ptr->next;
        count++;
    }
    printf("%d",count);
    
}
#include<stdio.h>
#include<stdlib.h>

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

void main(){
    struct node *head=NULL;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->link=NULL;

    struct node *current=NULL;
    current=malloc(sizeof(struct node));
    current->data=98;
    current->link=NULL;
    head->link=current;

    current=malloc(sizeof(struct node));
    current->data=3;
    current->link=NULL;
    head->link->link=current;

    current=malloc(sizeof(struct node));
    current->data=67;
    current->link=NULL;
    head->link->link->link=current;

    struct  node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }

    printf("\n");



//delete at specific position in a single linked list
/* LOGIC: using first pointer traverse till last node stop when first pointer points to last node
using second pointer traverse till the node to be deleted
using third pointer traverse till second node
update third pointer's link with third pointer value to join last node with second node 
and to cut link with third node
update second pointer's link to NULL in order to cut third node's link with last node
free second pointer to delete third node 
and update it with NULL so that it donot randomly point to anyone  */

    struct node *nextnode;
    nextnode=head;
    while(nextnode->link != NULL){
        nextnode=nextnode->link;
    }

    struct node *delnode;
    delnode=head;
    while(delnode->link->link != NULL){
        delnode=delnode->link;
    }

    struct node *prevnode;
    prevnode=head;
    while(prevnode->link->link->link != NULL){
        prevnode=prevnode->link;
    }

    prevnode->link=nextnode;
    delnode->link=NULL;
    free(delnode);
    delnode=NULL;

    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }

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

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

void main(){
    struct node *head=NULL;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->link=NULL;

    struct node *current=NULL;
    current=malloc(sizeof(struct node));
    current->data=98;
    current->link=NULL;
    head->link=current;

    current=malloc(sizeof(struct node));
    current->data=3;
    current->link=NULL;
    head->link->link=current;

    current=malloc(sizeof(struct node));
    current->data=67;
    current->link=NULL;
    head->link->link->link=current;

    struct  node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }

    printf("\n");


    //delete node from end in a single linked list
    /* LOGIC : using first pointer traverse till it points to last node 
    and then use second pointer to traverse till second last node 
    put NULL in link of second last node to make it end and to break link with last node
    then free first pointer who was still pointing to last node to delete last node permanently
    then set the next of first pointer to NULL so that it will not point to any thing. */

    struct node *lastnode;
    lastnode=head;
    while(lastnode->link != NULL){
        lastnode=lastnode->link;
    }

    struct node *secondlastnode;
    secondlastnode=head;
    while(secondlastnode->link->link != NULL){
        secondlastnode=secondlastnode->link;
    }

    secondlastnode->link=NULL;
    free(lastnode);
    lastnode=NULL;

    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }

}
//delete first node of linked list
#include<stdio.h>
#include<stdlib.h>

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

void main(){
    struct node *head=NULL;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->link=NULL;

    struct node *current=NULL;
    current=malloc(sizeof(struct node));
    current->data=98;
    current->link=NULL;
    head->link=current;

    current=malloc(sizeof(struct node));
    current->data=3;
    current->link=NULL;
    head->link->link=current;

    //delete first node in single linked list
    struct node *temp;
    temp=head;   //temp is pointing to first node in order to free it later
    head=head->link;  //head is pointing to second node
    free(temp);     //deleting the first node
    temp=NULL;

    struct  node *ptr=NULL;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }
}
//adding node at specific position in singly linked list 
//using another function
#include<stdio.h>
#include<stdlib.h>

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

void ins_at_beg(struct node *head,struct node *temp,int pos){
    struct node *ptr;
    ptr=head;
    pos--;
    while(pos != 1){
        ptr=ptr->link;
        pos--;
    }

    temp->link=ptr->link;
    ptr->link=temp;

    ptr=head;
    while(ptr !=NULL) {
        printf( "%d ", ptr->data);
        ptr = ptr->link;
    }
}
int main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->link=NULL;

    struct node *temp;
    temp=malloc(sizeof(struct node));
    temp->data=98;
    temp->link=NULL;
    head->link=temp;

    temp=malloc(sizeof(struct node));
    temp->data=3;
    temp->link=NULL;
    head->link->link=temp;


    temp=malloc(sizeof(struct node));
    temp->data=67;
    temp->link=NULL;
    int pos;
    printf("Enter the position: ");
    scanf("%d",&pos);
    ins_at_beg(head,temp,pos);

    return 0;
}
//adding node at specific position in singly linked list
#include<stdio.h>
#include<stdlib.h>

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

int main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->data=45;

    struct node *temp;
    temp=malloc(sizeof(struct node));
    temp->data=98;
    head->link=temp;

    temp=malloc(sizeof(struct node));
    temp->data=3;
    temp->link=NULL;
    head->link->link=temp;

    //new node to be inserted at specific 
    struct node  *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;
    newnode->link=NULL;

   /*  logic : first we have to join new node with next node 
    and then join previous node with new node .
    otherwise,
    if we first join previous node with new node we will loose the address of next node*/

    struct node *ptr;
    ptr=head;
    int pos=2;
    pos--;
    while(pos != 1){
        ptr=ptr->link;
        pos--;
    }

    newnode->link=ptr->link;
    ptr->link=newnode;

    ptr=head;
    while(ptr !=NULL) {
        printf( "%d ", ptr->data);
        ptr = ptr->link;
    }

    return 0;
}
//adding node at end in single linked list
#include<stdio.h>
#include<stdlib.h>

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

int main() {
    struct node *head = NULL;
    head = malloc(sizeof(struct node));
    head->data = 45;
    head->link = NULL;

    struct node *temp = NULL;
    temp = malloc(sizeof(struct node));
    temp->data = 98;
    temp->link = NULL;
    head->link = temp;

    struct node *ptr = NULL;

    temp = malloc(sizeof(struct node));
    temp->data = 3;
    temp->link = NULL;

    ptr = head;
    while (ptr->link != NULL) {
        ptr = ptr->link;
    }
    ptr->link = temp;    //adding node at last

    ptr = head; // Resetting ptr to head before traversing again
    while (ptr != NULL) {
        printf("%d ", ptr->data);
        ptr = ptr->link;
    }
    return 0;
}
//adding node at beginning in single linked list
#include<stdio.h>
#include<stdlib.h>

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

int main(){
    struct node *head;
    head=malloc(sizeof(struct node));
    head->data=45;
    head->link=NULL;

    struct node *temp;
    temp=malloc(sizeof(struct node));
    temp->data=98;
    temp->link=NULL;
    head->link=temp;

    temp=malloc(sizeof(struct node));
    temp->data=3;
    temp->link=NULL;
    head->link->link=temp;

    struct node *newnode;
    newnode=malloc(sizeof(struct node));
    newnode->data=67;
    newnode->link=head;

    head=newnode;
    struct node *ptr;
    ptr=head;
    while(ptr != NULL){
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }
    return 0;
}
 // HTML

 <div className='container' data-columns="4">
          <div className="container__block container__block--image1"></div>
          <div className="container__block container__block--image2"></div>
          <div className="container__block container__block--image3"></div>
          <div className="container__block"></div>
      </div>




// CSS

.container{
  width: 1200px;
  height: 600px;
  margin: auto auto;
   background-color: red;
   display: grid;
  //replace the value we want to make dynamic with a var(--something, x) where x is a fallback if --something doesnt exist
  grid-template-columns: repeat(var(--column-count, 4), 1fr); 
  place-content: center;
   align-items: center;
   justify-content: center;
   justify-items: center;

   // use data attribute vales on the html to change the variable --something
   &[data-columns="2"]{
      --column-count: 2;
   }

   &[data-columns="3"]{
    --column-count: 3;
    }

    &[data-columns="4"]{
      --column-count: 4;
    }



   &__block{
    width: 200px;
    height: 200px;
    background-color: rebeccapurple;
    border: 1px solid white;
    background-size: cover;
    background-repeat: no-repeat;
    background-image: var(--selected-url);

        &--image1{
          --selected-url: url('https://source.unsplash.com/user/c_v_r')
        }

        &--image2{
          --selected-url: url('https://www.kimballstock.com/images/car-stock-photos.jpg')
        }

        &--image3{
          --selected-url: url('https://media.gettyimages.com/id/1636857191/photo/topshot-moto-prix-esp-catalunya-practice.jpg?s=2048x2048&w=gi&k=20&c=bt3AqEevYACDxkxf5Rom1MqE4bjHrMG2apxxTkmedJ8=')
        }


   }
 }
https://source.unsplash.com/user/c_v_r
//This pulls out the two functions we need from the db connection file.
const { connectToDatabase, getDb } = require('./db');

// Middleware to connect to the database to see if it is working. If working it assigns the DB connection to a variable.
app.use(async (req, res, next) => {
  await connectToDatabase(); 
  next();
}); 


app.get("/", async (req, res) => {
  //Call our database function to get the variable holding our database connection.
  const db = getDb();
  const collection = db.collection("projects");

  const documents = await collection.find({}).toArray(); 
  res.render("pages/homepage");
});
#To add the URL fro the remote repository
git remote add origin REMOTE-URL

#to verify remote URL
git remote -v

echo "# ml_flow_test" >> README.md
git init
git add README.md
git commit -m "first commit"
git branch -M main
git remote add origin https://github.com/carlosribadeneira-se/ml_flow_test.git
git push -u origin main
git merge main

#To add the URL fro the remote repository
git remote add origin REMOTE-URL

#to verify remote URL
git remote -v

PS C:\WINDOWS\system32> reg add "HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\AppModelUnlock" /t REG_DWORD /f /v "AllowAllTrustedApps" /d "1"
//Import Routes 
const indexRoute = require('./routes/index');
const aboutRoute = require('./routes/about');
const pricingRoute = require('./routes/pricing');
const contactRoute = require('./routes/contact');

app.use(indexRoute);
app.use(aboutRoute);
app.use(pricingRoute);
app.use(contactRoute);
star

Wed Apr 10 2024 07:07:17 GMT+0000 (Coordinated Universal Time) https://chen-studio.co.il/wp-admin/admin.php?page

@chen #undefined

star

Wed Apr 10 2024 05:44:26 GMT+0000 (Coordinated Universal Time)

@naeemi7

star

Wed Apr 10 2024 05:35:15 GMT+0000 (Coordinated Universal Time) https://book.getfoundry.sh/forge/deploying

@katyno

star

Wed Apr 10 2024 05:35:11 GMT+0000 (Coordinated Universal Time) https://book.getfoundry.sh/forge/deploying

@katyno

star

Wed Apr 10 2024 05:34:43 GMT+0000 (Coordinated Universal Time) https://medium.com/@saadjamilakhtar/optimizing-django-performance-tips-and-techniques-for-blazing-fast-applications-ab6e5d5af799

@viperthapa #python

star

Wed Apr 10 2024 05:34:17 GMT+0000 (Coordinated Universal Time)

@divyasoni23 #jquery

star

Wed Apr 10 2024 03:45:09 GMT+0000 (Coordinated Universal Time)

@anmoltyagi

star

Wed Apr 10 2024 02:56:08 GMT+0000 (Coordinated Universal Time) https://www.w3schools.com/tags/tag_button.asp

@skatzy

star

Wed Apr 10 2024 02:55:46 GMT+0000 (Coordinated Universal Time) https://www.geeksforgeeks.org/how-to-show-images-on-click-using-html/#

@skatzy

star

Tue Apr 09 2024 23:29:21 GMT+0000 (Coordinated Universal Time)

@rafal_rydz

star

Tue Apr 09 2024 17:53:39 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 11:28:28 GMT+0000 (Coordinated Universal Time)

@zaki

star

Tue Apr 09 2024 10:27:03 GMT+0000 (Coordinated Universal Time)

@MrSpongeHead

star

Tue Apr 09 2024 10:07:45 GMT+0000 (Coordinated Universal Time)

@zaki

star

Tue Apr 09 2024 07:47:41 GMT+0000 (Coordinated Universal Time)

@divyasoni23 #jquery

star

Tue Apr 09 2024 07:34:17 GMT+0000 (Coordinated Universal Time) https://wordpress.stackexchange.com/questions/228591/to-perform-the-requested-action-wordpress-needs-to-access-your-web-server-pleas

@ioVista

star

Tue Apr 09 2024 07:24:08 GMT+0000 (Coordinated Universal Time)

@Saurabh_Lodhi #swift #inapppurchase

star

Tue Apr 09 2024 03:15:39 GMT+0000 (Coordinated Universal Time) https://www.google.com/maps/@42.0201354,-70.9238472,3a,19.7y,180.8h,93.99t/data

@docpainting

star

Tue Apr 09 2024 02:16:44 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:16:19 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:15:57 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:15:32 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:15:00 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:14:30 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:12:53 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:12:24 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:11:47 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:11:09 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:10:38 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:10:09 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:09:40 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:09:40 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:09:08 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:08:34 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:07:45 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:07:02 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:06:36 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:06:02 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:04:13 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:03:22 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 02:02:04 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 01:59:00 GMT+0000 (Coordinated Universal Time)

@wayneinvein

star

Tue Apr 09 2024 01:30:23 GMT+0000 (Coordinated Universal Time)

@davidmchale #custom #properties

star

Tue Apr 09 2024 01:29:12 GMT+0000 (Coordinated Universal Time)

@davidmchale #random #image #url

star

Mon Apr 08 2024 20:32:59 GMT+0000 (Coordinated Universal Time)

@jamzlego #nodejs

star

Mon Apr 08 2024 16:41:27 GMT+0000 (Coordinated Universal Time) https://docs.github.com/en/migrations/importing-source-code/using-the-command-line-to-import-source-code/adding-locally-hosted-code-to-github

@CarlosR

star

Mon Apr 08 2024 16:37:48 GMT+0000 (Coordinated Universal Time) https://docs.github.com/en/migrations/importing-source-code/using-the-command-line-to-import-source-code/adding-locally-hosted-code-to-github

@CarlosR

star

Mon Apr 08 2024 15:36:29 GMT+0000 (Coordinated Universal Time) https://learn.microsoft.com/sv-se/windows/apps/get-started/developer-mode-features-and-debugging#additional-developer-mode-features

@dw

Save snippets that work with our extensions

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