Deploy Next.js on AWS Amplify: A Step-by-Step GuideStep 1: Accessing the AWS Amplify Console Our journey begins in the AWS Management Console. To start, first choose a Region. This is an important decision as it determines the location of your application's infrastructure. Consider factors like your ...5 min read·blog.debjotyms.comNov 2, 2024
118. Pascal's Triangle[A1] - Brute Force Time: O(n^2) Space: O(n^2) class Solution: def generate(self, numRows: int) -> List[List[int]]: # Initialize the triangle with the first row pascal_triangle = [] for i in range(numRows): # S...1 min read·blog.debjotyms.comOct 25, 2024
1. Two SumYouTube Video https://youtu.be/hfN4VONP4HQ [A1] - Brute Force Time: O(n^2) Space: O(1) class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(len(nums)): for j in range(i+1, len(nums)): ...1 min read·blog.debjotyms.comOct 4, 2024
242. Valid AnagramLeetCode's Valid Anagram problem checks if two strings, `s` and `t`, are anagrams by comparing character frequencies.1 min read·blog.debjotyms.comMay 14, 2024
217. Contain DuplicateLeetCode's Contains Duplicate problem checks if there are any duplicate elements in a given array, often solved using hash sets or sorting.1 min read·blog.debjotyms.comMay 13, 2024
