Snippets Collections
 className="rounded-md text-[13px] text-grey-9 px-2 sm:px-4 py-2 sm:py-[11px] border border-grey-7 dark:text-const-white dark:border-const-white"
#include <stdio.h>
#include <ctype.h>

int main() {
    char c;
printf("Enter a stream of characters:");
    while((c=getchar())!= '\n')
{
    
    if(isalpha(c))
    {
    if((c=='a')||(c=='e')||(c=='i')||(c=='o')||(c=='u')||(c=='A')||(c=='E')||(c=='I')||(c=='O')||(c=='U'))
    putchar(toupper(c));
    else
    putchar(tolower(c));
    }
}

    return 0;
}
    className="ml-3 border border-primary text-sm leading-5 light:text-white font-medium dark:hover:text-const-white hover:text-white"
#include <stdio.h>

int byte2bits(int x);
int bits2byte(int x);

int main() {
    int choice, answer, byte, bit; 
    
    printf("[1] Byte to Bits [8] Bits to Byte [0] Exit\n");
    printf("Enter Choice:");
    scanf("%d", &choice);
    
    switch(choice)
{
    case 1:printf("Enter the number of byte:");
            scanf("%d", &byte);
            answer=byte2bits(byte);
            printf("%d byte/s = %d bit/s", byte, answer);
            
    break;
    case 8:printf("Enter the number of bits:");
            scanf("%d", &bit);
            answer=bits2byte(bit);
            printf("%d bit/s = %d byte/s", bit, answer);
            
    break;
    case 0:printf("\n\nExited Succesfully!");
    break;
}
}
int byte2bits(int x)
{
return(x*8);
}
int bits2byte(int x)
{
return(x/8);
}
import { NextResponse } from 'next/server'
import type { NextRequest } from 'next/server'
 
export function middleware(request: NextRequest) {
  if (request.nextUrl.pathname.startsWith('/about')) {
    return NextResponse.rewrite(new URL('/about-2', request.url))
  }
 
  if (request.nextUrl.pathname.startsWith('/dashboard')) {
    return NextResponse.rewrite(new URL('/dashboard/user', request.url))
  }
}
## This is the $$sentence$$ you need to evaluate.
## marker: "$$"
## int: 2


def produce(sentence, marker, num):
    sentence_arr = []
    for i in range (len(sentence)):
        sentence_arr.append(sentence[i])
    
    start_marker = marker[0]
    end_marker = marker[-1]
    
    new_sentence = ""
    
    for i in range(len(sentence_arr)):
        if sentence_arr[i] == start_marker or sentence_arr[i] == end_marker:
            continue
        else:
            ctr = num
            if sentence_arr[i-1] == end_marker:
                while ctr != 0 and sentence_arr[i+num] != start_marker:
                    new_sentence = new_sentence + sentence_arr[i]
                    ctr -= 1
                else:
                    new_sentence = new_sentence + "*"
                    
            else:
                new_sentence = new_sentence + sentence_arr[i]
    
    print(new_sentence)
    
    
produce("This is the $#sentence$# you need to evaluate.", "$#", 2)
#include <stdio.h>

float area(float r);

int main() {
    float radius, AOC;
    printf("--Area of Circle--\n");
    printf("Enter the radius of the circle:");
    scanf("%f", &radius);
    
    AOC=area(radius);
    printf("The area of the circle is %.2f", AOC);

}
float area(float r)
{
return(3.14159265359*r*r);
}
#include <stdio.h>
float convert(float x);


int main() {
    float inch, centimeter;
    printf("--Inch to Centimeter Convertion--\n");
    printf("Enter a number: ");
    scanf("%f", &inch);
    
    centimeter=convert(inch);
    printf("%.2f\' is equivalent to %.2f cm", inch, centimeter);
    
    return 0;
}

float convert(float x)
{
    return(x*2.54);
}
class fontstyle {
  static FontWeight? Fontweights({FWT fontWeight = FWT.regular}) {
    switch (FWT) {
      case FWT.bold:
        return FontWeight.w700;
      case FWT.semiBold:
        return FontWeight.w600;
      case FWT.medium:
        return FontWeight.w500;
      case FWT.regular:
        return FontWeight.w400;
      case FWT.light:
        return FontWeight.w300;
      default:
        return FontWeight.w400;
    }
  }

  static TextStyle f14(
      {required Color colors, FWT? fontweight, double height = 0.0}) {
    return TextStyle(
        fontSize: 14.sp,
        fontFamily: "Poppins",
        fontWeight: Fontweights(fontWeight: fontweight!),
        color: Colors.amberAccent);
  }

  static TextStyle f12(
      {required Color colors, FWT? fontweight, double height = 0.0}) {
    return TextStyle(
        fontSize: 12.sp,
        fontFamily: "Poppins",
        fontWeight: Fontweights(fontWeight: fontweight!),
        color: Colors.amberAccent);
  }
}
gAccount := Text001;  
    EmptyAccount := Text002;  
    MyAccount := Text003;  
    Message(Text004, Account, NegAccount, EmptyAccount, MyAccount);  
    ResultAccount := IncStr(Account);  
    ResultNegAccount := IncStr(NegAccount);  
    ResultEmptyAccount := IncStr(EmptyAccount);  
    ResultMyAccount := IncStr(MyAccount);  
    Message(Text005, ResultAccount, ResultNegAccount, ResultEmptyAccount, ResultMyAccount);  
#include <stdio.h>
#include <ctype.h>

int main() {
    char c;
//Write a program that will accept a series of characters, display the vowels int
// small letters and display the consonants in capital letters

    while((c=getchar())!='\n')
    {
        if(c=='a')||(c=='e')||(c=='i')||(c=='o')||(c=='u')||(c=='A')||(c=='E')||(c=='I')||(c=='O')||(c=='U')
        putchar(tolower(c));
        
        else
        putchar(toupper(c));
    }
    
    return 0;
}
#include <stdio.h>
#include <ctype.h>

int main() {
    char c;
    while ((c=getchar()) != '\n')
    {
        if (isalpha(c))
            putchar(c);
        else if (isdigit(c))
    {
            putchar(c);
            putchar(c);
    }
        else
    {
            putchar(c);
            putchar(c);
            putchar(c);
    }
    }
    
    return 0;
}
import java.util.*;

class Array<T extends Comparable<T>> {
    private int size;
    private T[] array;

    public Array(int size) {
        this.size = size;
        array = (T[]) new Comparable[size];
    }

    public void set(int index, T value) {
        array[index] = value;
    }

    public T min() {
        if (size == 0) return null;
        T minVal = array[0];
        for (int i = 1; i < size; i++) {
            if (array[i].compareTo(minVal) < 0) {
                minVal = array[i];
            }
        }
        return minVal;
    }

    public T max() {
        if (size == 0) return null;
        T maxVal = array[0];
        for (int i = 1; i < size; i++) {
            if (array[i].compareTo(maxVal) > 0) {
                maxVal = array[i];
            }
        }
        return maxVal;
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the size of the arrays");
        int size = sc.nextInt();

        Array<Integer> intArray = new Array<>(size);
        Array<Character> charArray = new Array<>(size);
        Array<Double> doubleArray = new Array<>(size);

        System.out.println("Enter the Integer value");
        for (int i = 0; i < size; i++) {
            intArray.set(i, sc.nextInt());
        }

        System.out.println("Enter the Characters");
        for (int i = 0; i < size; i++) {
            charArray.set(i, sc.next().charAt(0));
        }

        System.out.println("Enter the Double value");
        for (int i = 0; i < size; i++) {
            doubleArray.set(i, sc.nextDouble());
        }

        System.out.println("Maximum value in an integer array: " + intArray.max());
        System.out.println("Minimum value in an integer array: " + intArray.min());

        System.out.println("Maximum value in character array: " + charArray.max());
        System.out.println("Minimum value in character array: " + charArray.min());

        System.out.println("Maximum value in double array: " + doubleArray.max());
        System.out.println("Minimum value in double array: " + doubleArray.min());
    }
}
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter the number of address:");
        int n = scanner.nextInt();
        scanner.nextLine(); // Consume newline left-over

        Map<String, Map<String, Integer>> map = new HashMap<>();

        for (int i = 0; i < n; i++) {
            System.out.println("Enter the address:");
            String[] address = scanner.nextLine().split(",");
            String state = address[2];
            String city = address[1];

            if (!map.containsKey(state)) {
                map.put(state, new HashMap<>());
            }
            if (!map.get(state).containsKey(city)) {
                map.get(state).put(city, 0);
            }
            map.get(state).put(city, map.get(state).get(city) + 1);
        }

        List<String> states = new ArrayList<>(map.keySet());
        Collections.sort(states);

        System.out.println("Number of entries in city/state wise:");
        for (String state : states) {
            System.out.println("State:" + state);
            List<String> cities = new ArrayList<>(map.get(state).keySet());
            Collections.sort(cities);
            for (String city : cities) {
                System.out.println("City:" + city + " Count:" + map.get(state).get(city));
            }
            System.out.println();
        }
    }
}
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter the number of address:");
        int n = scanner.nextInt();
        scanner.nextLine(); // Consume newline left-over

        Map<String, Map<String, Integer>> map = new HashMap<>();

        for (int i = 0; i < n; i++) {
            System.out.println("Enter the address:");
            String[] address = scanner.nextLine().split(",");
            String state = address[2];
            String city = address[1];

            if (!map.containsKey(state)) {
                map.put(state, new HashMap<>());
            }
            if (!map.get(state).containsKey(city)) {
                map.get(state).put(city, 0);
            }
            map.get(state).put(city, map.get(state).get(city) + 1);
        }

        List<String> states = new ArrayList<>(map.keySet());
        Collections.sort(states);

        System.out.println("Number of entries in city/state wise:");
        for (String state : states) {
            System.out.println("State:" + state);
            List<String> cities = new ArrayList<>(map.get(state).keySet());
            Collections.sort(cities);
            for (String city : cities) {
                System.out.println("City:" + city + " Count:" + map.get(state).get(city));
            }
            System.out.println();
        }
    }
}
#include <stdio.h>
#include <ctype.h>

int main() {
    char c1;
    printf("Enter a character:");
    c1=getchar();
    printf("%c", toupper(c1));



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

    char word [128];
    int i =0;
    

    printf("Input a word:\n");
    scanf("%s",word);
    
    while(word[i]!='\0')
    {
        i++;
    }
    for(int i=0;i<=word[i];i++)
        {
            printf("%c\n",word[i]);
        }

return 0;    
}
#include <stdio.h>

int main() {
    char c1;
    printf("Enter a character:");
    c1=getchar();
    putchar(c1);

    return 0;
}

table 60000 "My Header"
{
    fields
    {
        field(1; "No."; Code[10]) { }
        field(2; Description; Text[50]) { }
    }
    keys
    {
        key(PK; "No.") { }
    }
    trigger OnInsert()
    var
        MyHeader: Record "My Header";
    begin
        if "No." = '' then
            if MyHeader.FindLast() then
                "No." := IncStr(MyHeader."No.")
            else
                "No." := 'HEADER001';
    end;
}
 <extend-text-input
                          v-model="invItem.useQuantity"
                          @keyup="handleKeyUp($event, invItem.quantity,bomIndex,index)"
                        />
以及method
 handleKeyUp(event, maxNumber , bomIndex,invIndex) {
    const inputValue = event.target.value;
    const newValue = inputValue.replace(/^0+|[^0-9]/g, '').replace(/(\d+)/, ($1) => (parseInt($1) > maxNumber ? maxNumber : $1)).substring(0, String(maxNumber).length);
    
    this.data[bomIndex].inventoryItems[invIndex].useQuantity = newValue;
  }
 <n-date-picker
            type="date"
            style="width: 100%"
            :formatted-value="formatDate(cylinderModal.dateRegularInspection)"
            value-format="yyyy-MM-dd"
            @update:formatted-value="updateDate('dateRegularInspection', $event)"
          />

function formatDate(date:any) {
      if (!date) return null; // 如果日期为空,返回空字符串
      return date.split('T')[0]; // 将日期字符串以T为分隔符拆分,取第一部分即可
    };

    function updateDate(field: keyof typeof cylinderModal.value, value:string) {
      cylinderModal.value[field] = value;
    }
[
    {
        "$match": {
            "authorization": {
                "$ne": null
            }
        }
    },
    {
        "$match": {
            "email": {
                "$not": {
                    "$regularExpression": {
                        "pattern": "deleted",
                        "options": ""
                    }
                }
            }
        }
    },
 
    {
        "$lookup": {
            "from": "participant",
            "localField": "email",
            "foreignField": "email",
            "as": "userParticipant"
        }
    },
    {
        "$match": {}
    },
    {
        "$lookup": {
            "from": "masterSlot",
            "localField": "userParticipant._id",
            "foreignField": "navigatorId",
            "as": "slots"
        }
    },
    {
        "$lookup": {
            "from": "userCoachMapping",
            "localField": "userParticipant._id",
            "foreignField": "coachID",
            "as": "userCoachMapping"
        }
    },
    {
        "$project": {
        
            "isCoachActive": {
                "$arrayElemAt": [
                    "$userParticipant.active",
                    0
                ]
            },
        
            "email": {
                "$arrayElemAt": [
                    "$userParticipant.email",
                    0
                ]
            },
            "firstName": {
                "$arrayElemAt": [
                    "$userParticipant.firstName",
                    0
                ]
            },
            "coachProfileDescription": {
                "$arrayElemAt": [
                    "$userParticipant.coachProfileDescription",
                    0
                ]
            },
    
            "middleName": {
                "$arrayElemAt": [
                    "$userParticipant.middleName",
                    0
                ]
            },
            "lastName": {
                "$arrayElemAt": [
                    "$userParticipant.lastName",
                    0
                ]
            },
            "partnerShortCode": {
                "$arrayElemAt": [
                    "$userParticipant.partnerShortCode",
                    0
                ]
            },
    
            "role": {
                "$arrayElemAt": [
                    "$userParticipant.role",
                    0
                ]
            },
            "templateName": "$authorization.name",
            "servicePartnerShortCode": "$servicePartnerShortCode",
            "userVisibility": "$userVisibility",
    
            "Total Users": {
                "$size": {
                    "$filter": {
                        "input": "$userCoachMapping",
                        "as": "coach",
                        "cond": { "$eq": ["$$coach.userStatus", "ACTIVE"] }
                    }
                }
            }
            _id:0
        }
    },
    {
        $match:{
            "Total Users": { "$gt": 0 }
        }
    }
]
{
    "quantity": 2,
    "type": "template_button",
    "data": [
        {
            "name": "tai khoan 1",
            "nameDisplay": "tai khoan 1",
            "content":  "tai khoan 1",
        },
        {
            "name": "tai khoan 2",
            "nameDisplay": "tai khoan 2",
            "content":  "tai khoan 2"
        }
    ]
}
import java.util.*;
import java.lang.*;
import java.io.*;

class Codechef
{
    public static String findBinary(int num, String result) {
        if(num == 0)
            return result;
        
        result = num % 2 + result;
        return findBinary(num / 2, result);
    } 
	public static void main (String[] args) throws java.lang.Exception
	{
		System.out.println(findBinary(12, ""));

	}
}
import java.util.*;
import java.lang.*;
import java.io.*;

class Codechef
{
    public static boolean isPalindrome(String str) {
        if(str.length() == 0 || str.length() == 1)
            return true;
        
        if(str.charAt(0) == str.charAt(str.length() - 1))
            return isPalindrome(str.substring(1, str.length() - 1));
        
        return false;
        
    }
	public static void main (String[] args) throws java.lang.Exception
	{
		System.out.println(isPalindrome("abcba"));

	}
}
import java.util.*;
import java.lang.*;
import java.io.*;

class Codechef
{
    public static String reverse(String input) {
        if(input.equals(""))
            return "";
        return reverse(input.substring(1)) + input.charAt(0);
    }
	public static void main (String[] args) throws java.lang.Exception
	{
	    
	   System.out.println(reverse("hello"));
	}
}
import java.util.*;
import java.lang.*;
import java.io.*;

class Codechef
{
    public static int recursiveSum(int num) {
        if(num <= 1)
            return num;
        
        return num + recursiveSum(num - 1);
        
    }
	public static void main (String[] args) throws java.lang.Exception
	{
		System.out.println(recursiveSum(10));

	}
}


// -----------------------------------------------------------
header{
	position: fixed;
    width: 100%;
    z-index: 500;
	top: -40px;
}
#include <stdio.h>

int main() {
    printf("AP SERIES CREATOR\n\");
    printf("Please Enter The values, To Create Your AP Series \n");
    
    int n;
    printf("Enter The Value Of N'th Term : ");
    scanf("%d",&n);
    
    int m;
    printf("Enter The Starting Number of AP : ");
    scanf("%d",&m); 
    
    int p;
    printf("Enter The Defferance Between Two Numbers Of AP : ");
    scanf("%d",&p);
    
     printf("Your AP Series Is : \n");
    for(int i=m;i<=(2*n-1);i=i+p){
        printf("%d\t",i);
    }
    return 0;
}
conda environments:

   base           /home/username/Anaconda3
   myenvironment   * /home/username/Anaconda3/envs/myenvironment
conda environments:

   base           /home/username/Anaconda3
   myenvironment   * /home/username/Anaconda3/envs/myenvironment
star

Thu Apr 25 2024 10:39:35 GMT+0000 (Coordinated Universal Time)

@2018331055

star

Thu Apr 25 2024 09:44:51 GMT+0000 (Coordinated Universal Time)

@2018331055

star

Thu Apr 25 2024 09:28:05 GMT+0000 (Coordinated Universal Time) https://medium.com/@z22857744/middleware-in-next-js-ac3df3bd4162

@temp

star

Thu Apr 25 2024 09:21:06 GMT+0000 (Coordinated Universal Time)

@lawlaw

star

Thu Apr 25 2024 09:05:42 GMT+0000 (Coordinated Universal Time)

@kervinandy123 #c

star

Thu Apr 25 2024 08:53:13 GMT+0000 (Coordinated Universal Time)

@kervinandy123 #c

star

Thu Apr 25 2024 07:51:39 GMT+0000 (Coordinated Universal Time)

@hey123 #dart #flutter

star

Thu Apr 25 2024 06:45:15 GMT+0000 (Coordinated Universal Time) https://learn.microsoft.com/en-us/dynamics365/business-central/dev-itpro/developer/methods-auto/text/text-incstr-method

@obaidullahjadun

star

Thu Apr 25 2024 05:54:57 GMT+0000 (Coordinated Universal Time)

@kervinandy123 #c

star

Thu Apr 25 2024 05:34:44 GMT+0000 (Coordinated Universal Time)

@kervinandy123 #c

star

Thu Apr 25 2024 05:33:30 GMT+0000 (Coordinated Universal Time)

@signup

star

Thu Apr 25 2024 05:33:07 GMT+0000 (Coordinated Universal Time)

@signup

star

Thu Apr 25 2024 05:21:35 GMT+0000 (Coordinated Universal Time)

@signup

star

Thu Apr 25 2024 05:21:04 GMT+0000 (Coordinated Universal Time)

@kervinandy123 #c

star

Thu Apr 25 2024 05:12:02 GMT+0000 (Coordinated Universal Time) https://codevalidator.aut.ac.nz/autmoodle1/mod/quiz/attempt.php?attempt

@meanaspotato

star

Thu Apr 25 2024 05:11:49 GMT+0000 (Coordinated Universal Time)

@kervinandy123 #c

star

Thu Apr 25 2024 05:11:12 GMT+0000 (Coordinated Universal Time) https://www.kauffmann.nl/2020/07/01/deep-insert-with-business-central-apis-part-2/

@obaidullahjadun

star

Thu Apr 25 2024 04:28:42 GMT+0000 (Coordinated Universal Time)

@kiroy

star

Thu Apr 25 2024 04:27:20 GMT+0000 (Coordinated Universal Time)

@kiroy

star

Thu Apr 25 2024 04:12:30 GMT+0000 (Coordinated Universal Time) http://34.74.16.180:3000/question#eyJkYXRhc2V0X3F1ZXJ5Ijp7InR5cGUiOiJuYXRpdmUiLCJuYXRpdmUiOnsiY29sbGVjdGlvbiI6InVzZXJzIiwicXVlcnkiOiJbXHJcbiAgICB7XHJcbiAgICAgICAgXCIkbWF0Y2hcIjoge1xyXG4gICAgICAgICAgICBcImF1dGhvcml6YXRpb25cIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkbmVcIjogbnVsbFxyXG4gICAgICAgICAgICB9XHJcbiAgICAgICAgfVxyXG4gICAgfSxcclxuICAgIHtcclxuICAgICAgICBcIiRtYXRjaFwiOiB7XHJcbiAgICAgICAgICAgIFwiZW1haWxcIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkbm90XCI6IHtcclxuICAgICAgICAgICAgICAgICAgICBcIiRyZWd1bGFyRXhwcmVzc2lvblwiOiB7XHJcbiAgICAgICAgICAgICAgICAgICAgICAgIFwicGF0dGVyblwiOiBcImRlbGV0ZWRcIixcclxuICAgICAgICAgICAgICAgICAgICAgICAgXCJvcHRpb25zXCI6IFwiXCJcclxuICAgICAgICAgICAgICAgICAgICB9XHJcbiAgICAgICAgICAgICAgICB9XHJcbiAgICAgICAgICAgIH1cclxuICAgICAgICB9XHJcbiAgICB9LFxyXG4gXHJcbiAgICB7XHJcbiAgICAgICAgXCIkbG9va3VwXCI6IHtcclxuICAgICAgICAgICAgXCJmcm9tXCI6IFwicGFydGljaXBhbnRcIixcclxuICAgICAgICAgICAgXCJsb2NhbEZpZWxkXCI6IFwiZW1haWxcIixcclxuICAgICAgICAgICAgXCJmb3JlaWduRmllbGRcIjogXCJlbWFpbFwiLFxyXG4gICAgICAgICAgICBcImFzXCI6IFwidXNlclBhcnRpY2lwYW50XCJcclxuICAgICAgICB9XHJcbiAgICB9LFxyXG4gICAge1xyXG4gICAgICAgIFwiJG1hdGNoXCI6IHt9XHJcbiAgICB9LFxyXG4gICAge1xyXG4gICAgICAgIFwiJGxvb2t1cFwiOiB7XHJcbiAgICAgICAgICAgIFwiZnJvbVwiOiBcIm1hc3RlclNsb3RcIixcclxuICAgICAgICAgICAgXCJsb2NhbEZpZWxkXCI6IFwidXNlclBhcnRpY2lwYW50Ll9pZFwiLFxyXG4gICAgICAgICAgICBcImZvcmVpZ25GaWVsZFwiOiBcIm5hdmlnYXRvcklkXCIsXHJcbiAgICAgICAgICAgIFwiYXNcIjogXCJzbG90c1wiXHJcbiAgICAgICAgfVxyXG4gICAgfSxcclxuICAgIHtcclxuICAgICAgICBcIiRsb29rdXBcIjoge1xyXG4gICAgICAgICAgICBcImZyb21cIjogXCJ1c2VyQ29hY2hNYXBwaW5nXCIsXHJcbiAgICAgICAgICAgIFwibG9jYWxGaWVsZFwiOiBcInVzZXJQYXJ0aWNpcGFudC5faWRcIixcclxuICAgICAgICAgICAgXCJmb3JlaWduRmllbGRcIjogXCJjb2FjaElEXCIsXHJcbiAgICAgICAgICAgIFwiYXNcIjogXCJ1c2VyQ29hY2hNYXBwaW5nXCJcclxuICAgICAgICB9XHJcbiAgICB9LFxyXG4gICAge1xyXG4gICAgICAgIFwiJHByb2plY3RcIjoge1xyXG4gICAgICAgIFxyXG4gICAgICAgICAgICBcImlzQ29hY2hBY3RpdmVcIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkYXJyYXlFbGVtQXRcIjogW1xyXG4gICAgICAgICAgICAgICAgICAgIFwiJHVzZXJQYXJ0aWNpcGFudC5hY3RpdmVcIixcclxuICAgICAgICAgICAgICAgICAgICAwXHJcbiAgICAgICAgICAgICAgICBdXHJcbiAgICAgICAgICAgIH0sXHJcbiAgICAgICAgXHJcbiAgICAgICAgICAgIFwiZW1haWxcIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkYXJyYXlFbGVtQXRcIjogW1xyXG4gICAgICAgICAgICAgICAgICAgIFwiJHVzZXJQYXJ0aWNpcGFudC5lbWFpbFwiLFxyXG4gICAgICAgICAgICAgICAgICAgIDBcclxuICAgICAgICAgICAgICAgIF1cclxuICAgICAgICAgICAgfSxcclxuICAgICAgICAgICAgXCJmaXJzdE5hbWVcIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkYXJyYXlFbGVtQXRcIjogW1xyXG4gICAgICAgICAgICAgICAgICAgIFwiJHVzZXJQYXJ0aWNpcGFudC5maXJzdE5hbWVcIixcclxuICAgICAgICAgICAgICAgICAgICAwXHJcbiAgICAgICAgICAgICAgICBdXHJcbiAgICAgICAgICAgIH0sXHJcbiAgICAgICAgICAgIFwiY29hY2hQcm9maWxlRGVzY3JpcHRpb25cIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkYXJyYXlFbGVtQXRcIjogW1xyXG4gICAgICAgICAgICAgICAgICAgIFwiJHVzZXJQYXJ0aWNpcGFudC5jb2FjaFByb2ZpbGVEZXNjcmlwdGlvblwiLFxyXG4gICAgICAgICAgICAgICAgICAgIDBcclxuICAgICAgICAgICAgICAgIF1cclxuICAgICAgICAgICAgfSxcclxuICAgIFxyXG4gICAgICAgICAgICBcIm1pZGRsZU5hbWVcIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkYXJyYXlFbGVtQXRcIjogW1xyXG4gICAgICAgICAgICAgICAgICAgIFwiJHVzZXJQYXJ0aWNpcGFudC5taWRkbGVOYW1lXCIsXHJcbiAgICAgICAgICAgICAgICAgICAgMFxyXG4gICAgICAgICAgICAgICAgXVxyXG4gICAgICAgICAgICB9LFxyXG4gICAgICAgICAgICBcImxhc3ROYW1lXCI6IHtcclxuICAgICAgICAgICAgICAgIFwiJGFycmF5RWxlbUF0XCI6IFtcclxuICAgICAgICAgICAgICAgICAgICBcIiR1c2VyUGFydGljaXBhbnQubGFzdE5hbWVcIixcclxuICAgICAgICAgICAgICAgICAgICAwXHJcbiAgICAgICAgICAgICAgICBdXHJcbiAgICAgICAgICAgIH0sXHJcbiAgICAgICAgICAgIFwicGFydG5lclNob3J0Q29kZVwiOiB7XHJcbiAgICAgICAgICAgICAgICBcIiRhcnJheUVsZW1BdFwiOiBbXHJcbiAgICAgICAgICAgICAgICAgICAgXCIkdXNlclBhcnRpY2lwYW50LnBhcnRuZXJTaG9ydENvZGVcIixcclxuICAgICAgICAgICAgICAgICAgICAwXHJcbiAgICAgICAgICAgICAgICBdXHJcbiAgICAgICAgICAgIH0sXHJcbiAgICBcclxuICAgICAgICAgICAgXCJyb2xlXCI6IHtcclxuICAgICAgICAgICAgICAgIFwiJGFycmF5RWxlbUF0XCI6IFtcclxuICAgICAgICAgICAgICAgICAgICBcIiR1c2VyUGFydGljaXBhbnQucm9sZVwiLFxyXG4gICAgICAgICAgICAgICAgICAgIDBcclxuICAgICAgICAgICAgICAgIF1cclxuICAgICAgICAgICAgfSxcclxuICAgICAgICAgICAgXCJ0ZW1wbGF0ZU5hbWVcIjogXCIkYXV0aG9yaXphdGlvbi5uYW1lXCIsXHJcbiAgICAgICAgICAgIFwic2VydmljZVBhcnRuZXJTaG9ydENvZGVcIjogXCIkc2VydmljZVBhcnRuZXJTaG9ydENvZGVcIixcclxuICAgICAgICAgICAgXCJ1c2VyVmlzaWJpbGl0eVwiOiBcIiR1c2VyVmlzaWJpbGl0eVwiLFxyXG4gICAgXHJcbiAgICAgICAgICAgIFwiVG90YWwgVXNlcnNcIjoge1xyXG4gICAgICAgICAgICAgICAgXCIkc2l6ZVwiOiB7XHJcbiAgICAgICAgICAgICAgICAgICAgXCIkZmlsdGVyXCI6IHtcclxuICAgICAgICAgICAgICAgICAgICAgICAgXCJpbnB1dFwiOiBcIiR1c2VyQ29hY2hNYXBwaW5nXCIsXHJcbiAgICAgICAgICAgICAgICAgICAgICAgIFwiYXNcIjogXCJjb2FjaFwiLFxyXG4gICAgICAgICAgICAgICAgICAgICAgICBcImNvbmRcIjogeyBcIiRlcVwiOiBbXCIkJGNvYWNoLnVzZXJTdGF0dXNcIiwgXCJBQ1RJVkVcIl0gfVxyXG4gICAgICAgICAgICAgICAgICAgIH1cclxuICAgICAgICAgICAgICAgIH1cclxuICAgICAgICAgICAgfVxyXG4gICAgICAgICAgICBfaWQ6MFxyXG4gICAgICAgIH1cclxuICAgIH0sXHJcbiAgICB7XHJcbiAgICAgICAgJG1hdGNoOntcclxuICAgICAgICAgICAgXCJUb3RhbCBVc2Vyc1wiOiB7IFwiJGd0XCI6IDAgfVxyXG4gICAgICAgIH1cclxuICAgIH1cclxuXSIsInRlbXBsYXRlLXRhZ3MiOnt9fSwiZGF0YWJhc2UiOjJ9LCJkaXNwbGF5IjoidGFibGUiLCJ2aXN1YWxpemF0aW9uX3NldHRpbmdzIjp7fX0=

@CodeWithSachin #aggregation #mongodb #map #filter #size

star

Thu Apr 25 2024 03:55:39 GMT+0000 (Coordinated Universal Time)

@manhmd

star

Wed Apr 24 2024 19:58:09 GMT+0000 (Coordinated Universal Time)

@harunmunjal #java

star

Wed Apr 24 2024 19:57:06 GMT+0000 (Coordinated Universal Time)

@harunmunjal #java

star

Wed Apr 24 2024 19:56:36 GMT+0000 (Coordinated Universal Time)

@harunmunjal #java

star

Wed Apr 24 2024 19:56:07 GMT+0000 (Coordinated Universal Time)

@harunmunjal #java

star

Wed Apr 24 2024 12:56:53 GMT+0000 (Coordinated Universal Time)

@SophieLCDZ

star

Wed Apr 24 2024 12:24:58 GMT+0000 (Coordinated Universal Time)

@Amlan #c

star

Wed Apr 24 2024 12:20:46 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit

star

Wed Apr 24 2024 12:20:35 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit

star

Wed Apr 24 2024 12:19:55 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:54 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:52 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:51 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:50 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:46 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:46 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:45 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:45 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:43 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit #

star

Wed Apr 24 2024 12:19:42 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/getting-started.html

@ditherbit

star

Wed Apr 24 2024 12:17:22 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/concepts/installing-with-conda.html

@ditherbit

star

Wed Apr 24 2024 12:17:05 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/concepts/conda-commands.html

@ditherbit

star

Wed Apr 24 2024 12:16:52 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/tasks/view-command-line-help.html

@ditherbit

star

Wed Apr 24 2024 12:15:51 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/commands/index.html

@ditherbit

star

Wed Apr 24 2024 12:15:29 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/tasks/creating-projects.html

@ditherbit

star

Wed Apr 24 2024 12:15:16 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/tasks/manage-virtual.html

@ditherbit

star

Wed Apr 24 2024 12:15:10 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/tasks/manage-python.html

@ditherbit

star

Wed Apr 24 2024 12:15:04 GMT+0000 (Coordinated Universal Time) https://conda.io/projects/conda/en/latest/user-guide/tasks/manage-channels.html

@ditherbit

Save snippets that work with our extensions

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