© 2023 Hashnode
#leetcode
Introduction It's bullshit! 😉 You don't need Leetcode to succeed in tech. You need the skills and experience to help companies build real shit. And, of course, as I always say, get your name out the…
const nums = [2, 7, 11, 15]; const target = 9; const twoSum = function(nums, target) { const hashTable = {}; //created a hashtable for (let i = 0; i < nums.length; i++) { if (hashTable[t…
Heyo. I’m a new grad looking for an SWE job, and I wanted to share my selected group of resources I use to study and keep up with the job hunt. I hope this helps others in similar positions. 💡 Rememb…
Problem Statement:- Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. Note: You can only move eithe…
Problem Statement:- You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge. The graph is represented with a given 0-indexed array edges of si…
These patterns are based on the different problems identified by me. Viewers can also add their own identified patterns incase those patterns were missed in this article. In this article , I will disc…
Problem Statement:- You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [a<sub>i</sub>, b<sub>i</su…
I haven't written here in a while (if you consider 4 months to be a while :)). You may ask why? Well, I have been busy. Busy becoming a better competitive programmer. It is a hassle but it is fun at t…
Problem Statement:- There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). Last year, The minist…
Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Since it is impossible to change the len…
