ericviana

'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';

ericviana

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)=>{

ericviana

<div class="h-screen bg-white w-full grid place-items-center">
  <span class="block relative before:bg-[#04D2A9] before:content-[' '] before:block before:absolute before:-inset-[1px] before:-z-10 z-10 before:rounded-[0.85rem]">
    <span class="block bg-[#04D2A9] text-white rounded-[0.8rem] z-10 shadow-sm shadow-[#1F2A37]/40">
      <button class="z-10 group flex items-center gap-3 bg-gradient-to-b from-white/30 to-transparent rounded-[0.8rem] relative before:bg-[#04D2A9] before:content-[' '] before:block before:absolute before:inset-[1px] before:rounded-[0.75rem] before:-z-10 p-2">
        <span><svg width="23" height="23" viewBox="0 0 20 20" fill="none" xmlns="http://www.w3.org/2000/svg">
            <path d="M10 4.16667V15.8333M4.16666 10H15.8333" stroke="white" stroke-width="1.7" stroke-linecap="round" stroke-linejoin="round" />
          </svg>
        </span>
        <span>New template</span>
        <span class="bg-[#03BE99] px-2 py-1 rounded-[0.45rem] text-sm">

ericviana

Unicode Character Look-Alikes

Original Letter	Look-Alike(s)
a	а ạ ą ä à á ą
c	с ƈ ċ
d	ԁ ɗ
e	е ẹ ė é è
g	ġ
h	һ

ericviana

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) {

ericviana

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);

ericviana

{
  "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,
}

ericviana

.main {
  width: 100vw;
  min-height: 100vh;
  position: fixed;
  display: flex;
  justify-content: center;
  padding: 120px 24px 160px 24px;
  pointer-events: none;
}

ericviana

body {
  background-size: 40px 40px;
  background-image:
    linear-gradient(to right, grey 1px, transparent 1px),
    linear-gradient(to bottom, grey 1px, transparent 1px);
}

ericviana

Array

• Two Sum
• Best Time to Buy and Sell Stock
• Contains Duplicate
• Product of Array Except Self
• Maximum Subarray
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array