ericviana

{
"Fros": "www.fros.dev",
"Raunt": "www.raunt.app",
"Crafta": "www.crafta.studio"
}

ericviana

SWIFT        17 hrs 15 mins  ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⣀⣀⣀⣀⣀   73.70 %
METAL        7 hrs 45 mins   ⣿⣿⣿⣿⣿⣷⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀   23.59 %
PROTO        54 mins         ⣤⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀   01.24 %
SVELTE       14 mins         ⣄⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀   00.75 %
RUST         12 mins         ⣄⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀   00.65 %
Other        1 min           ⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀⣀   00.07 %

ericviana

import axios from "axios";

axios.get('https://api.github.com/users/ericviana')
.then (response => axios.get(response.data.repos_url))
.then (repos => console.log(repos.data))
.catch (error => console.log(error))

ericviana

import axios from 'axios'

async function fetchRepos () {
  try {
    const user = await axios.get('https://api.github.com/users/ericviana')
    const repos = await axios.get(user.data.repos_url)
    console.log(repos)

  } catch (e) {
    console.log(e)

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

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

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

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

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

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