Index Page: Starting my DSA journey, Table of Content Intro Extras Leetcode patterns Intro Starting my DSA journey on this platform. I will blog about leetcode patterns and problem...

Leetcode — 2769. Find the Maximum Achievable Number,This is an easy problem with description being: Given two integers, num and t. A number is achievable if it can become equal to...

387. First Unique Character in a String - Java 練習 - HashMap （中文解釋）, 題目 https://leetcode.com/problems/first-unique-character-in-a-string/ https://www.geeksforgeeks.org/pro...

242. Valid Anagram - Java 練習 - HashMap （中文解釋）, 題目 https://leetcode.com/problems/valid-anagram https://www.geeksforgeeks.org/problems/anagram-1587115620/1 (POTD) 題意 Anag...

Leetcode — Top Interview 150–125. Valid Palindrome,It’s an easy problem with description being: A phrase is a palindrome if, after converting all uppercase letters into lowercas...

Leetcode — Top Interview 150–121. Best Time to Buy and Sell Stock,It’s an easy problem with the description being: You are given an array prices where prices[i] is the price of ...

1342. Number of Steps to Reduce a Number to Zero, Problem https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/ Solution class Solution { public int numberOfSte...

412. Fizz Buzz, Problem https://leetcode.com/problems/fizz-buzz/description/ Solution 01 class Solution { public List<String> fizzBuzz(int n) { List<String> ans = new A...

1672. Richest Customer Wealth, Problem https://leetcode.com/problems/richest-customer-wealth/description/ Solution class Solution { public int maximumWealth (int[][] accounts) { in...

1480. Running Sum of 1d Array, Problem Solving -----------Problem----------- Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Retu...

Leetcode — Top Interview 150–169. Majority Element,It’s an easy problem with the description being: Given an array nums of size n, return the majority element. The majority elem...

Leetcode — Top Interview 150 — Remove Element,It’s an easy problem that consists in: Given an integer array nums and an integer val, remove all occurrences of val in nums in-pla...