Skip to content

Mahmudjust/Leetcode_One_Day_One_Problem_Challenge

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Leetcode_One_Day_One_Problem_Challenge

About

This repository is created for cracking November 2023 leetcode problem with the following ideas:

  1. Have to crack one problem within one day.
  2. Try to solve it alone without anyones help
  3. Learn new algorithm and data structure if necessary to crack the problem

Purpose

The purpose of this repo is to challenge myself each day. Also here are some other things:

  1. Inherit a wide angle of solutions to tackle a problem
  2. Build a problem solver attitude
  3. Build confidence to tackle any problem
  4. To track the progress

Challenges of November 2023

1.Day 01 Challenge: Find Mode in Binary Search Tree [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_501.py]

2.Day 02 Challenge: Count Nodes Equal to Average of Subtree [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2265.py]

3.Day 03 Challenge: Build an Array With Stack Operations [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1441.py]

4.Day 04 Challenge: Last Moment Before All Ants Fall Out of a Plank [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1503.py]

5.Day 05 Challenge: Find the Winner of an Array Game [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1535.py]

6.Day 06 Challenge: Seat Reservation Manager [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1845.py]

7.Day 07 Challenge: Eliminate maximum number of monsters [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1921]

8.Day 08 Challenge: Determine if a Cell Is Reachable at a Given Time [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2849.py]

9.Day 09 Challenge: Count Number of Homogenous Substrings [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1759.py]

10.Day 10 Challenge: Restore the Array From Adjacent Pairs [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1743.py]

11.Day 11 Challenge: Design Graph With Shortest Path Calculator [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2642.py]

12.Day 12 Challenge: Bus Routes

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_815.py]

13.Day 13 Challenge: Sort Vowels in a String [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2785.py]

14.Day 14 Challenge: Unique Length-3 Palindromic Subsequences [https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1930.py]

15.Day 15 Challenge: Maximum Element After Decreasing and Rearranging

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1846.py]

16.Day 16 Challenge: Find Unique Binary String

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1980.py]

17.Day 17 Challenge: Minimize Maximum Pair Sum in Array

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1877.py]

18.Day 18 Challenge: Frequency of the Most Frequent Element

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1838.py]

19.Day 19 Challenge: Reduction Operations to Make the Array Elements Equal

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1887.py]

20.Day 20 Challenge: Minimum Amount of Time to Collect Garbage

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2391.py]

21.Day 21 Challenge: Count Nice Pairs in an Array

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1814.py]

22.Day 22 Challenge: Diagonal Traverse II

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1424.py]

23.Day 23 Challenge: Arithmetic Subarrays [1630]

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1630.py]

24.Day 24 Challenge: Maximum Number of Coins You Can Get [1561]

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1561.py]

25.Day 25 Challenge: Sum of Absolute Differences in a Sorted Array [1685]

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1685.py]

26.Day 26 Challenge: Largest Submatrix With Rearrangements [1727]

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1727.py]

27.Day 27 Challenge: Knight Dialer [935]

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_935.py]

28.Day 28 Challenge:Number of Ways to Divide a Long Corridor [2147]

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2147.py]

29.Day 29 Challenge:191. Number of 1 Bits

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_0191.py]

30.Day 30 Challenge:1611. Minimum One Bit Operations to Make Integers Zero

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1611.py]

Challenges of December 2023

31.Day 31 Challenge: 1662. Check If Two String Arrays are Equivalent

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1662.py]

32.Day 32 Challenge: 1160. Find Words That Can Be Formed by Characters

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1160.py]

33.Day 33 Challenge: 1266. Minimum Time Visiting All Points

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1266.py]

34.Day 34 Challenge: 2264.Largest 3-Same-Digit Number in String

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_2264.py]

35.Day 35 Challenge: 1688. Count of Matches in Tournament

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1688.py]

36.Day 36 Challenge: 1716. Calculate Money in Leetcode Bank

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1716.py]

37.Day 37 Challenge:1903. Largest Odd Number in String

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1903.py]

38.Day 38 Challenge: 606. Construct String from Binary Tree

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_0606.py]

39.Day 39 Challenge: 94. Binary Tree Inorder Traversal

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_0094.py]

40.Day 40 Challenge: 867. Transpose Matrix

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_0867.py]

41.Day 41 Challenge: 1287. Element Appearing More Than 25% In Sorted Array

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1287.py]

42.Day 42 Challenge:1464. Maximum Product of Two Elements in an Array

[https://github.com/Mahmudjust/Leetcode_One_Day_One_Problem_Challenge/blob/main/leetcode_1464.py]

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages