Snippets Collections
sudo apt remove --purge emacs-bin-common emacs-el emacs-gtk
const randomInt = Math.floor(Math.random() * 10) + 1;
console.log(randomInt);
List Of given states and their capitals:

Gujarat : Gandhinagar
Maharashtra : Mumbai
Rajasthan : Jaipur
Bihar : Patna
Button myButton = findViewById(R.id.my_button);
myButton.setOnClickListener(new View.OnClickListener() {
    @Override
    public void onClick(View view) {
        doSomething();
    }
});

private void doSomething() {
    // Do something when the button is clicked
}
using System;
using System.Linq;
using System.IO;
using System.Text;
using System.Collections;
using System.Collections.Generic;

namespace ConsoleApp1
{
    class Link
    {
        public int n1;
        public int n2;

        public Link(int n1, int n2)
        {
            this.n1 = n1;
            this.n2 = n2;
        }
    }

    class Player
    {
        static void Main(string[] args)
        {
            string[] inputs;
            inputs = Console.ReadLine().Split(' ');
            int N = int.Parse(inputs[0]); // the total number of nodes in the level, including the gateways
            int L = int.Parse(inputs[1]); // the number of links
            int E = int.Parse(inputs[2]); // the number of exit gateways
            int EI = 0;

            List<Link> links = new List<Link>();
            List<int> exits = new List<int>();

            for (int i = 0; i < L; i++)
            {
                inputs = Console.ReadLine().Split(' ');
                int N1 = int.Parse(inputs[0]); // N1 and N2 defines a link between these nodes
                int N2 = int.Parse(inputs[1]);
               
                Link newLink = new Link(N1, N2);
            
                links.Add(newLink);
            }
            for (int i = 0; i < E; i++)
            {
                EI = int.Parse(Console.ReadLine()); // the index of a gateway node
                exits.Add(EI);
            }

            // game loop
            while (true)
            {
                int SI = int.Parse(Console.ReadLine()); // The index of the node on which the Bobnet agent is positioned this turn

                string cut = null;

                bool wasCut = false;
                for (int i = 0; i < links.Count; i++)
                {
                    if ((links[i].n1 == SI && exits.Contains(links[i].n2)) || (links[i].n2 == SI && exits.Contains(links[i].n1)))
                    {

                        if (links[i].n2 == SI)
                        {
                            cut = SI.ToString() + " " + links[i].n1.ToString();
                            links.Remove(links[i]);
                            wasCut = true;
                            break;
                        }
                        else
                        {
                            cut = SI.ToString() + " " + links[i].n2.ToString();
                            links.Remove(links[i]);
                            wasCut = true;
                            break;
                        }
                    }
                }

                if (!wasCut)
                {
                    foreach (Link l in links)
                    {
                        if ((exits.Contains(l.n2) || exits.Contains(l.n1)) && l.cut == false)
                        {
                            cut = l.n1.ToString() + " " + l.n2.ToString();
                            links.Remove(l);
                        }
                    }
                }

                foreach (int e in exits)
                {
                    Console.Error.WriteLine(SI + " " + e);
                }


                // Example: 0 1 are the indices of the nodes you wish to sever the link between
                Console.WriteLine(cut);
            }
        }
    }
}
/*odstraneni vsech animaci*/
	.et_pb_section * {
		-o-transition-property: none!important;
		-moz-transition-property: none!important;
		-webkit-transition-property: none!important;
		transition-property: none!important;
		-o-transform: none!important;
		-moz-transform: none!important;
		-ms-transform: none!important;
		-webkit-transform: none!important;
		transform: none!important;
		-webkit-animation: none!important;
		-moz-animation: none!important;
		-o-animation: none!important;
		animation: none !important;
	}
const arr=[1,4,3,2,6,7,8]

function twoSum(arr, S) {
 const sum = [];
  for(let i = 0; i< arr.length; i++) {
    for(let j = i+1;  j < arr.length; j++) {
      if( arr[i] + arr[j]==S) sum.push(arr[i],arr[j])
    }
  }
 return sum
}

console.log(twoSum(arr,8))
vector < vector < int >> printAdjacency(int n, int m, vector < vector < int >> & edges) {
    vector<int> ans[n];
    //ans array will store all adjaject nodes corresponding to indexes.
    for(int i=0;i<m;i++)
    {
        int u=edges[i][0];
        int v=edges[i][1];

        ans[u].push_back(v);
        ans[v].push_back(u);
    }

    vector<vector<int>> adj(n);
    for(int i=0;i<n;i++)
    {
        adj[i].push_back(i);

        //entering neighbours
        for(int j=0;j<ans[i].size();j++)
        {
            adj[i].push_back(ans[i][j]);
        }
    }
    return adj;
}
# nvm set default node.js version 16.14.2
$ nvm alias default 16.14.2
$ nvm use

$ node -v
# v16.14.2
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(!root) return NULL;
        if(root==p||root==q) return root;
        
        TreeNode* l=lowestCommonAncestor(root->left, p, q);
        TreeNode* r=lowestCommonAncestor(root->right, p, q);
        
        if(!l) return r;
        else if(!r) return l;
        else return root;
    }
};
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

//BFS Travesal

class Solution {
public:
    int kthSmallest(TreeNode* root, int k) {
        vector<int> v;
        queue<TreeNode*> q;
        TreeNode* p;
        q.push(root);
        
        while(!q.empty())
        {
            p=q.front();
            q.pop();
            ///int p2=p->val;
            v.push_back(p->val);
            if(p->left) q.push(p->left);
            if(p->right) q.push(p->right);
        }
        sort(v.begin(), v.end());
        return v[k-1];
    }
};

//Inorder traversal

class Solution {
public:
    int kthSmallest(TreeNode* root, int k) {
        vector<int> v;
        queue<TreeNode*> q;
        TreeNode* p;
        q.push(root);
        
        while(!q.empty())
        {
            p=q.front();
            q.pop();
            ///int p2=p->val;
            v.push_back(p->val);
            if(p->left) q.push(p->left);
            if(p->right) q.push(p->right);
        }
        sort(v.begin(), v.end());
        return v[k-1];
    }
};
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    
    bool isValidBST(TreeNode* root) {
       
        return check(root, LONG_MIN, LONG_MAX);
    }
    
   bool check(TreeNode* root, long minval, long maxval)
   {
       if(!root) return true;
       if(root->val>=maxval||root->val<=minval) return false;
       
       return check(root->left, minval, root->val)&&check(root->right, root->val, maxval);
   }
};
{
	"data": {
		"search": {
			"entities": [
				{
					"id": "78a7711c-c3a4-45ff-bac1-1d40037804ba",
					"recordInsights": {
						"FirstName": [
							"John"
						],
						"LastName": [
							"Doe"
						],
						"Email": [
							"second@email.com",
							"third@email.com",
							"first@email.com"
						],
						"Total": 59.59
					}
				}
			]
		}
	}
}
{
	search(
		input: {
			parameters: {
				firstName: "John"
				lastName: "Doe"
				street: "Somestreet"
				houseNumber: "1"
				postalCode: "12345"
				city: "Somecity"
			}
		}
	) {
		entities {
			id
			recordInsights {
				FirstName: valuesDistinct(field: "firstName")
				LastName: valuesDistinct(field: "lastName")
				Email: valuesDistinct(field: "email")
				Total: sum(field: "totalprice")
			}
		}
	}
}
{
	"data": {
		"search": {
			"entities": [
				{
					"id": "78a7711c-c3a4-45ff-bac1-1d40037804ba",
					"records": [
						{
							"id": "34ac20d1-1ea8-4375-9433-2b5d5e065abe",
							"firstName": "John",
							"lastName": "Doe",
							"email": "second@email.com",
							"totalprice": 15
						},
						{
							"id": "d4a7d4d5-42a3-4bf4-befe-0ab47816138d",
							"firstName": "John",
							"lastName": "Doe",
							"email": "third@email.com",
							"totalprice": 34.59
						},
						{
							"id": "748b4a1b-5461-4539-8452-38362b8c8d78",
							"firstName": "John",
							"lastName": "Doe",
							"email": "first@email.com",
							"totalprice": 10
						}
					]
				}
			]
		}
	}
}
{
	search(
		input: {
			parameters: {
				firstName: "John"
				lastName: "Doe"
				street: "Somestreet"
				houseNumber: "1"
				postalCode: "12345"
				city: "Somecity"
			}
		}
	) {
		entities {
			id
			records {
				id
				firstName
				lastName
				email
				totalprice
			}
		}
	}
}
{"firstName":"John","lastName":"Doe","dateOfBirth":"01.01.1980","street":"Somestreet","houseNumber":"1","postalCode":"12345","city":"Somecity","source":"Shop1","email":"first@email.com","totalprice":10.00}
{"firstName":"John","lastName":"Doe","dateOfBirth":"01.01.1980","street":"Somestreet","houseNumber":"1","postalCode":"12345","city":"Somecity","source":"Shop2","email":"second@email.com","totalprice":15.00}
{"firstName":"John","lastName":"Doe","dateOfBirth":"01.01.1980","street":"Somestreet","houseNumber":"1","postalCode":"12345","city":"Somecity","source":"Shop3","email":"third@email.com","totalprice":34.59}
<!DOCTYPE html>
<html>
<head>
    <title>Remove Duplicate Objects from Array Jquery Example - Tutsmake.com</title>
    <script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js"></script>
</head>
<body>
   
<script type="text/javascript">
    
  var myArray = [
        { "id" : "1", "firstName" : "Michael", "lastName" : "stoddardd" }, 
        { "id" : "2", "firstName" : "Kate", "lastName" : "smith" }, 
        { "id" : "3", "firstName" : "john", "lastName" : "sam" }, 
        { "id" : "1", "firstName" : "Kate", "lastName" : "smith" }, 
        { "id" : "5", "firstName" : "Michael", "lastName" : "stoddardd" }
      ];
    
  function removeDumplicateValue(myArray){ 
      var newArray = [];
    
      $.each(myArray, function(key, value) {
        var exists = false;
        $.each(newArray, function(k, val2) {
          if(value.id == val2.id){ exists = true }; 
        });
        if(exists == false && value.id != "") { newArray.push(value); }
      });
   
      return newArray;
    }
    
    console.log(removeDumplicateValue(myArray));
</script>
    
</body>
</html>
https://codepen.io/Elodieb/pen/OJyLxXm
https://codepen.io/r3dg3cko/pen/ZLryQG
int ENA = 5;
int in1 = 7;
int in2 = 8;

void setup(){
  pinMode(ENA, OUTPUT);
  pinMode(in1, OUTPUT);
  pinMode(in2, OUTPUT);
  analogWrite(ENA, HIGH);
}

void loop() {
  digitalWrite(in1, LOW);
  digitalWrite(in2, HIGH);
  delay(1000);
  digitalWrite(in1, LOW);
  digitalWrite(in2, LOW);
  delay(1000);
}
  const resizeOps = () => {
    document.documentElement.style.setProperty("--vh", window.innerHeight * 0.01 + "px");
  };

  resizeOps();
  window.addEventListener("resize", resizeOps);
:on-change="(file, fileList) => {handleChange(file, fileList, index)}"
Sure! Here's a more complete example that demonstrates how to bind a hidden field to a component and update its value based on the value of another form field:

HTML template:

html
Copy code
<form [formGroup]="myForm" (ngSubmit)="onSubmit()">
  <div>
    <label>First Name: <input type="text" formControlName="firstName"></label>
  </div>
  <div>
    <label>Last Name: <input type="text" formControlName="lastName"></label>
  </div>
  <div>
    <label>Email Address: <input type="email" formControlName="email"></label>
  </div>
  <div>
    <label>Phone Number: <input type="text" formControlName="phoneNumber"></label>
  </div>
  <div>
    <input type="hidden" name="fullName" formControlName="fullName" [hidden]="!myForm.controls['fullName'].value">
    <p *ngIf="myForm.controls['fullName'].value">Full Name: {{ myForm.controls['fullName'].value }}</p>
  </div>
  <button type="submit">Submit</button>
</form>
Component:

typescript
Copy code
import { Component } from '@angular/core';
import { FormBuilder, FormGroup, Validators } from '@angular/forms';

@Component({
  selector: 'app-my-component',
  templateUrl: './my-component.component.html',
  styleUrls: ['./my-component.component.css']
})
export class MyComponent {

  myForm: FormGroup;

  constructor(private fb: FormBuilder) {
    this.myForm = this.fb.group({
      firstName: ['', Validators.required],
      lastName: ['', Validators.required],
      email: ['', [Validators.required, Validators.email]],
      phoneNumber: ['', Validators.required],
      fullName: ['']
    });

    // Listen for changes to the 'firstName', 'lastName', 'email', and 'phoneNumber' controls
    this.myForm.controls['firstName'].valueChanges.subscribe(value => {
      this.updateFullName();
    });
    this.myForm.controls['lastName'].valueChanges.subscribe(value => {
      this.updateFullName();
    });
    this.myForm.controls['email'].valueChanges.subscribe(value => {
      this.updateFullName();
    });
    this.myForm.controls['phoneNumber'].valueChanges.subscribe(value => {
      this.updateFullName();
    });
  }

  onSubmit() {
    console.log(this.myForm.value);
  }

  private updateFullName() {
    // Concatenate the values of the 'firstName', 'lastName', 'email', and 'phoneNumber' controls
    const fullName = `${this.myForm.controls['firstName'].value} ${this.myForm.controls['lastName'].value} (${this.myForm.controls['email'].value}, ${this.myForm.controls['phoneNumber'].value})`;

    // Update the value of the hidden field
    this.myForm.controls['fullName'].setValue(fullName);
  }

}
In this example, we added subscriptions to the valueChanges observables of the 'firstName', 'lastName', 'email', and 'phoneNumber' controls that call a private updateFullName() method. This method concatenates the values of these controls and sets the value of the hidden field (fullName) based on the concatenated value.

We also added an *ngIf directive to the HTML template to conditionally show the full name when the value of the hidden field is truthy.

I hope this helps! Let me know if you have any further questions.





any way to do that ?
Yes, there are multiple ways to achieve this behavior in Angular. One way is to use the (ngModelChange) directive on the input field that triggers the update, and then update the value of the hidden field in the component. Here's an example:

HTML template:

html
Copy code
<input type="text" [(ngModel)]="firstName" (ngModelChange)="updateFullName()">
<input type="hidden" [value]="fullName">
<p *ngIf="fullName">Full Name: {{ fullName }}</p>
Component:

typescript
Copy code
import { Component } from '@angular/core';

@Component({
  selector: 'app-my-component',
  templateUrl: './my-component.component.html',
  styleUrls: ['./my-component.component.css']
})
export class MyComponent {

  firstName: string = '';
  lastName: string = '';
  email: string = '';
  phoneNumber: string = '';
  fullName: string = '';

  updateFullName() {
    // Concatenate the values of the 'firstName', 'lastName', 'email', and 'phoneNumber' fields
    this.fullName = `${this.firstName} ${this.lastName} (${this.email}, ${this.phoneNumber})`;
  }

}
In this example, we used two-way data binding with [(ngModel)] to bind the value of the firstName field to a variable in the component. We also added the (ngModelChange) directive to trigger the updateFullName() method in the component whenever the value of firstName changes. The updateFullName() method concatenates the values of the fields and sets the value of the fullName variable in the component. Finally, we used the [value] directive to bind the value of the hidden field to the fullName variable, and added an *ngIf directive to conditionally show the full name when the fullName variable is truthy.

I hope this helps! Let me know if you have any further questions.





wich one is the popular chose ?
The approach I mentioned earlier, which uses two-way data binding with (ngModel) and (ngModelChange), is a popular choice for binding hidden fields in Angular. However, there are other ways to achieve the same behavior, such as using reactive forms and updating the value of the hidden field using the patchValue() or setValue() methods of the form control. The choice ultimately depends on your specific use case and preferences.
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(!root) return NULL;
        if(root==p||root==q) return root;
        TreeNode* l=lowestCommonAncestor(root->left, p, q);
        TreeNode* r=lowestCommonAncestor(root->right, p, q);
        
        if(!l) return r;
        else if(!r) return l;
        else return root;
    }
};
selectedOptions: string[] = [];
onSelect(option: string) {
  if (!this.selectedOptions.includes(option)) {
    this.selectedOptions.push(option);
  }
}

removeOption(option: string) {
  const index = this.selectedOptions.indexOf(option);
  if (index > -1) {
    this.selectedOptions.splice(index, 1);
  }
}
<select (change)="onSelect($event.target.value)">
  <option value="" disabled selected>Select an option</option>
  <option value="Option 1">Option 1</option>
  <option value="Option 2">Option 2</option>
  <option value="Option 3">Option 3</option>
</select>

<ul>
  <li *ngFor="let option of selectedOptions">
    {{ option }}
    <button (click)="removeOption(option)">Remove</button>
  </li>
</ul>
let str1="o";
let str2="a"

console.log(str1.localeCompare(str2))
//output is 1.
//because str2 pahale yetet according to alphabetical order
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    
    int largeheight(TreeNode* root)
    {
        if(!root) return 0;
        return max(largeheight(root->left), largeheight(root->right))+1;
    }

    int diameterOfBinaryTree(TreeNode* root) {
        if(!root) return 0;
        int h1=largeheight(root->left);
        int h2=largeheight(root->right);
        int p1=h1+h2;
        return max(p1, max(diameterOfBinaryTree(root->left), diameterOfBinaryTree(root->right)));
    }
};
#List of Tuples
list_tuples =  [('Nagendra',18),('Nitesh',28),('Sathya',29)]

#To print the list of tuples using for loop you can print by unpacking them
for name,age in list_tuples:
  print(name,age)

#To print with enumerate--->enumerate is nothing but gives the index of the array.
for index,(name,age) in list_tuples:
  #print using fstring
  print(f'My name is {name} and age is {age} and index is {index}')
  #print using .format
  print('My name is {n} and age is {a} and index is {i}'.format(n=name,a=age,i=index))
 
const fruits = [
  { name: 'apple', color: 'green' },
  { name: 'banana', color: 'yellow' },
  { name: 'orange', color: 'orange' }
];

fruits.sort((a, b) => a.color.localeCompare(b.color)); // Sort by color
console.log(fruits); // Output: [{name: "orange", color: "orange"}, {name: "apple", color: "green"}, {name: "banana", color: "yellow"}]

map.keys.forEach((k) => print("Key : $k"));

map.values.forEach((v) => print("Value: $v"));

map.forEach((k, v) => print("Key : $k, Value : $v"));
star

Thu Mar 16 2023 18:21:03 GMT+0000 (UTC) https://stackoverflow.com/questions/57895073/how-remove-emacs-full

@challow #lisp

star

Thu Mar 16 2023 17:56:54 GMT+0000 (UTC) https://www.google.com/search?q

@szczurek

star

Thu Mar 16 2023 17:42:39 GMT+0000 (UTC) https://developer.apple.com/forums/thread/704099

@Gimnath

star

Thu Mar 16 2023 17:39:10 GMT+0000 (UTC) https://www.geeksforgeeks.org/iterate-over-a-dictionary-in-python/

@knguyencookie

star

Thu Mar 16 2023 17:25:18 GMT+0000 (UTC)

@judith #java

star

Thu Mar 16 2023 17:09:37 GMT+0000 (UTC)

@Fwedy #c#

star

Thu Mar 16 2023 16:51:20 GMT+0000 (UTC)

@hedviga

star

Thu Mar 16 2023 15:45:59 GMT+0000 (UTC) https://mac.install.guide/ruby/13.html

@Gimnath

star

Thu Mar 16 2023 15:13:04 GMT+0000 (UTC) https://www.starwindsoftware.com/starwind-v2v-converter

@D_GEIGER

star

Thu Mar 16 2023 15:03:24 GMT+0000 (UTC) https://aidanfinn.com/?p

@D_GEIGER

star

Thu Mar 16 2023 15:00:37 GMT+0000 (UTC)

@vishal

star

Thu Mar 16 2023 14:56:58 GMT+0000 (UTC) https://www.carlstalhood.com/published-applications/

@D_GEIGER

star

Thu Mar 16 2023 14:53:31 GMT+0000 (UTC) https://community.spiceworks.com/topic/2300755-unable-to-delete-hyper-v-vm-checkpoints

@D_GEIGER

star

Thu Mar 16 2023 14:50:54 GMT+0000 (UTC) https://www.tutorialspoint.com/how-to-get-the-path-of-the-currently-executing-script-in-powershell

@D_GEIGER

star

Thu Mar 16 2023 14:50:44 GMT+0000 (UTC) https://stackoverflow.com/questions/58277512/powershell-script-working-directory-current-location

@D_GEIGER

star

Thu Mar 16 2023 14:50:09 GMT+0000 (UTC) https://community.spiceworks.com/topic/2200852-how-to-find-adfs-servers-in-the-environment

@D_GEIGER

star

Thu Mar 16 2023 14:49:55 GMT+0000 (UTC) https://michaeldeblok.wordpress.com/2016/07/01/how-to-find-all-the-adfs-servers-in-your-environment-and-run-diagnostics-against-them/

@D_GEIGER

star

Thu Mar 16 2023 14:44:12 GMT+0000 (UTC) https://www.codingninjas.com/codestudio/problems/create-a-graph-and-print-it_1214551?leftPanelTab=0

@Ranjan_kumar #c++

star

Thu Mar 16 2023 13:28:46 GMT+0000 (UTC) https://smsagent.blog/2017/05/18/find-the-full-windows-build-number-with-powershell/

@D_GEIGER

star

Thu Mar 16 2023 12:23:01 GMT+0000 (UTC) https://stackoverflow.com/questions/47190861/how-can-the-default-node-version-be-set-using-nvm

@Gimnath #bash

star

Thu Mar 16 2023 12:08:03 GMT+0000 (UTC) https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

@Ranjan_kumar #c++

star

Thu Mar 16 2023 11:41:32 GMT+0000 (UTC) https://leetcode.com/problems/kth-smallest-element-in-a-bst/

@Ranjan_kumar #c++

star

Thu Mar 16 2023 11:13:27 GMT+0000 (UTC) https://docs.oracle.com/en/cloud/saas/netsuite/ns-online-help/section_163284532674.html

@mdfaizi

star

Thu Mar 16 2023 11:13:02 GMT+0000 (UTC) undefined

@mdfaizi

star

Thu Mar 16 2023 10:01:05 GMT+0000 (UTC) https://leetcode.com/problems/validate-binary-search-tree/

@Ranjan_kumar #c++

star

Thu Mar 16 2023 10:00:56 GMT+0000 (UTC)

@Tilores

star

Thu Mar 16 2023 10:00:17 GMT+0000 (UTC)

@Tilores

star

Thu Mar 16 2023 09:58:18 GMT+0000 (UTC)

@Tilores

star

Thu Mar 16 2023 09:57:38 GMT+0000 (UTC)

@Tilores

star

Thu Mar 16 2023 09:56:16 GMT+0000 (UTC)

@Tilores

star

Thu Mar 16 2023 09:13:27 GMT+0000 (UTC) https://favtutor.com/blogs/dictionary-comprehension-python

@billypeterson

star

Thu Mar 16 2023 09:11:26 GMT+0000 (UTC) https://www.tutsmake.com/remove-duplicate-objects-from-array-in-jquery/

@skfaizan2301

star

Thu Mar 16 2023 09:02:25 GMT+0000 (UTC)

@mubashir_aziz

star

Thu Mar 16 2023 08:07:31 GMT+0000 (UTC)

@prox

star

Thu Mar 16 2023 08:03:39 GMT+0000 (UTC) https://sfwiseguys.wordpress.com/2020/08/10/lwc-with-vf-in-an-iframe-bidirectional-communication/

@pradeepkumar28

star

Thu Mar 16 2023 08:00:19 GMT+0000 (UTC) https://stackoverflow.com/questions/37328942/react-native-change-default-ios-simulator-device

@Gimnath

star

Thu Mar 16 2023 07:17:44 GMT+0000 (UTC)

@iliavial

star

Thu Mar 16 2023 06:46:15 GMT+0000 (UTC) https://dev.to/ozanbolel/fit-your-website-to-the-viewport-on-mobile-38hl

@norbertcki

star

Thu Mar 16 2023 06:32:34 GMT+0000 (UTC) https://github.com/rbenv/rbenv/issues/1267

@Gimnath

star

Thu Mar 16 2023 06:10:37 GMT+0000 (UTC)

@kiroy

star

Thu Mar 16 2023 05:34:40 GMT+0000 (UTC) https://chat.openai.com/chat

@assleep #angular

star

Thu Mar 16 2023 02:50:50 GMT+0000 (UTC) https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/

@Ranjan_kumar #c++

star

Wed Mar 15 2023 20:54:16 GMT+0000 (UTC)

@chicovirabrikin

star

Wed Mar 15 2023 20:35:23 GMT+0000 (UTC)

@peterlulu666

star

Wed Mar 15 2023 20:00:53 GMT+0000 (UTC) https://www.programiz.com/javascript/online-compiler/

@bhushan03

star

Wed Mar 15 2023 19:52:28 GMT+0000 (UTC) https://leetcode.com/problems/diameter-of-binary-tree/

@Ranjan_kumar #c++

star

Wed Mar 15 2023 19:51:16 GMT+0000 (UTC) https://www.google.com/search?newwindow

@bertill #python

star

Wed Mar 15 2023 19:36:58 GMT+0000 (UTC)

@bhushan03

star

Wed Mar 15 2023 17:58:53 GMT+0000 (UTC) https://stackoverflow.com/questions/54715554/should-i-prefer-to-iterate-over-map-entries-or-map-values

@chandan

star

Wed Mar 15 2023 17:58:19 GMT+0000 (UTC)

@chandan

Save snippets that work with our extensions

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