Original Letter | Look-Alike(s) |
---|---|
a | а ạ ą ä à á ą |
c | с ƈ ċ |
d | ԁ ɗ |
e | е ẹ ė é è |
g | ġ |
h | һ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
'use client'; | |
import * as React from 'react'; | |
import Image from 'next/image'; | |
import * as AccordionPrimitive from '@radix-ui/react-accordion'; | |
import { cn } from '@/lib/utils'; | |
import Pl from '../../../public/hands/Plus.svg'; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const results = [ | |
['Url', 'Anchor Text', 'External'] | |
]; | |
var urls = document.getElementsByTagName('a'); | |
for (urlIndex in urls) { | |
const url = urls[urlIndex] | |
const externalLink = url.host !== window.location.host | |
if(url.href && url.href.indexOf('://')!==-1) results.push([url.href, url.text, externalLink]) // url.rel | |
} | |
const csvContent = results.map((line)=>{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function binarySearch(arr, target) { | |
let left = 0; | |
let right = arr.length - 1; | |
while (left <= right) { | |
let mid = Math.floor((left + right) / 2); | |
if (arr[mid] === target) { | |
return mid; | |
} else if (arr[mid] < target) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function dijkstra(graph, startNode) { | |
const distances = {}; | |
const visited = {}; | |
const queue = []; | |
distances[startNode] = 0; | |
queue.push({ node: startNode, distance: 0 }); | |
while (queue.length > 0) { | |
queue.sort((a, b) => a.distance - b.distance); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"workbench.layoutControl.enabled": false, | |
"workbench.editor.tabSizing": "shrink", | |
"workbench.editor.limit.perEditorGroup": true, | |
"window.commandCenter": true, | |
"breadcrumbs.enabled": false, | |
"workbench.editor.showTabs": false, | |
"editor.minimap.autohide": true, | |
"workbench.activityBar.visible": false, | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
.main { | |
width: 100vw; | |
min-height: 100vh; | |
position: fixed; | |
display: flex; | |
justify-content: center; | |
padding: 120px 24px 160px 24px; | |
pointer-events: none; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
body { | |
background-size: 40px 40px; | |
background-image: | |
linear-gradient(to right, grey 1px, transparent 1px), | |
linear-gradient(to bottom, grey 1px, transparent 1px); | |
} |
NewerOlder