-
Blind-75 is a curated list of 75 LeetCode problems compiled by Yangshun Tay. The list can be accessed at this link. Initially, I solved each problem using a brute-force …
Read More -
Author: Sadman Kabir Soumik Original Two Sum Problem Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to …
Read More -
122.Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to …
Read More -
Combine two lists as a dictionary | dict(zip) Program 1keys = ['a', 'b', 'c'] 2values = [1, 2, 3] 3dictionary = dict(zip(keys, values)) …
Read More -
Breadth-first search (BFS) and depth-first search (DFS) are two algorithms for traversing graphs. These algorithms are used to search for specific nodes or to find the …
Read More -
Check Prime Number A prime number is a positive integer greater than 1 that has no positive integer divisors other than 1 and itself. For example, the first six prime …
Read More