Leetcode - 383. Ransom Note
🚀 JavaScript Map (HashMap) Basics
Definition: A Map stores key-value pairs and maintains insertion order.
Key Types: Any (string, number, object, etc.).
✅ Common Methods
⛶...
2206. Divide Array Into Equal Pairs
2206. Divide Array Into Equal PairsDifficulty: EasyTopics: Array, Hash Table, Bit Manipulation, CountingYou are given an integer array nums consisting of 2 * n integers.You need to divide nums into n ...
Leetcode - 205. Isomorphic Strings
Javascript Code
⛶/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isIsomorphic = function (s, t) {
if (s.length !== t.length) return false;
const mapST = new Map()...
Leetcode - 290. Word Pattern
Javascript Code
⛶/**
* @param {string} pattern
* @param {string} s
* @return {boolean}
*/
var wordPattern = function (pattern, s) {
let patternMap = new Map();
let sMap = new Map();
...
Leetcode - 242. Valid Anagram
Approach 1
⛶/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isAnagram = function(s, t) {
let sortedSArr = s.split('').sort();
let sortedTArr = t.split('').sort();
...
2401. Longest Nice Subarray
2401. Longest Nice SubarrayDifficulty: MediumTopics: Array, Bit Manipulation, Sliding WindowYou are given an array nums consisting of positive integers.We call a subarray of nums nice if the bitwise A...
Leetcode - 56. Merge Intervals
Using Sorting
Chapter 1
⛶/**
* @param {number[][]} intervals
* @return {number[][]}
*/
function merge(intervals) {
const sortInterval = intervals.sort((a, b) => a[0] - b[0])
c...
3191. Minimum Operations to Make Binary Array Elements Equal to One I
3191. Minimum Operations to Make Binary Array Elements Equal to One IDifficulty: MediumTopics: Array, Bit Manipulation, Queue, Sliding Window, Prefix SumYou are given a binary array1 nums.You can do t...
O porque você precisa treinar LeetCode constantemente
A Importância do LeetCode: Benefícios e Como Pode Ajudar em Entrevistas TécnicasNo mundo da tecnologia, a busca por uma vaga em empresas renomadas, as famigeradas "FAANG" (Facebook - atual Meta, Ap...
3108. Minimum Cost Walk in Weighted Graph
3108. Minimum Cost Walk in Weighted GraphDifficulty: HardTopics: Array, Bit Manipulation, Union Find, GraphThere is an undirected weighted graph with n vertices labeled from 0 to n - 1.You are given t...