100 Day Of Code

My code collection of 100 Days Of Coding Challenge!

Collection Index :

1. Rangoli Generative Art :
   JavaScript project created on the auspicious day of Diwali festival ✨, to celebrate Rangoli 🌸 in a Digital manner using Generative Art.

2. Tic Tac Toe :
   A fun little game created in JavaScript 🔥 with an elegant modern design! 🌸

3. Jump Game LeetCode : 🐸
   We are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if we can reach the last index, or false otherwise.

4. Maximum Bags With Full Capacity of Rocks LeetCode : 💰
   We are given two arrays capacity and rocks. The ith bag can hold a maximum of capacity[i] rocks and currently contains rocks[i] rocks. We are also given an integer additionalRocks, we can place it in any of the bags. Return the maximum number of bags that could have full capacity after placing the additional rocks in some bags.

5. Remove Stones to Minimize the Total LeetCode : 🍪
   We are given an array piles, where piles[i] is number of stones in ith pile, and an integer k. Choose any piles[i] and remove floor(piles[i] / 2) stones from it. We should apply this operation exactly k times and return the minimum possible total number of stones.

6. Regular Expression Matching LeetCode : 😃!=😭
   Given an input string s and a pattern p, implement regular expression matching with '.' for any single character and '*' for zero or more of the preceding element. The matching should cover the entire input string (not partial) and return true or false.

7. Design Circular Queue LeetCode : ♻️
   Design circular queue, it is a linear data structure, which follows FIFO (First In First Out) principle, and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer". By using circular queue, we can utlize empty spaces in front of the queue.

8. Word Pattern LeetCode : 🧩
   Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.

9. Detect Capital LeetCode : 📜
   We define the usage of capitals in a word to be right when one of the case is followed: all letters capital, all letters not capital or only first letter capital. Given a string word, return true if the usage of capitals is right.

10. Container With Most Water LeetCode : 💧
    Given an array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that it contains the most water. Return the maximum amount of water a container can store.

11. Delete Columns to Make Sorted LeetCode : 🗑️
    Given an array of n strings strs, all of the same length. The strings could form a grid. For example,strs=["abc", "bce", "cae"]. We want to delete the columns that are not sorted lexicographically and return the number of columns.

12. Minimum Rounds to Complete All Tasks LeetCode : 🔁✅
    Given an array tasks, where tasks[i] represents the difficulty level of a task. In each round, you can complete either 2 or 3 tasks of the same difficulty level. Return the minimum rounds required to complete all the tasks, or -1 if it is not possible to complete all the tasks.

13. Largest Number LeetCode : 💯
    Given a list of non-negative integers nums, arrange them such that they form the largest number and return it. Since the result may be very large, so we need to return a string instead of an integer.

14. Minimum Number of Arrows to Burst Balloons LeetCode : 🎯🎈
    There are some spherical balloons taped onto a flat wall. The balloons are represented as a 2D integer array, where each element represents a range on the x-axis. Arrows can be shot up from the x-axis to burst the balloons. Find the minimum number of arrows needed to burst all the balloons.

15. Sort the People LeetCode : 🔢👥
    Given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each index i, names[i] and heights[i] denote the name and height of the ith person. Return names sorted in descending order of heights.

16. Maximum Ice Cream Bars LeetCode : 😋🍦
    On a summer day, a boy wants to buy some ice cream bars. Given an array costs of length n, where costs[i] is the price of the ith ice cream bar in coins. The boy initially has coins to spend, and he wants to buy as many ice cream bars as possible. Return the maximum number of ice cream bars the boy can buy with coins.

17. Plus One LeetCode : 👍
    Given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's. Increment the large integer by one and return the resulting array of digits.

18. Gas Station LeetCode : ⛽
    Given two arrays representing a circular journey with n gas stations: gas and cost. Our car has an unlimited gas tank and it costs a certain amount of gas to travel from one station to the next. Find the index of the gas station where we can start the journey and complete the circuit once. Return -1 if it is not possible.

19. Keyboard Row LeetCode : 💻
    Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like: first row is "qwertyuiop", second row is "asdfghjkl", and third row is "zxcvbnm".

20. Max Points on a Line LeetCode : 🔢📏
    Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line.

21. Minimum Difference Between Highest and Lowest of K Scores LeetCode : 🔼🔽
    Given an array nums, where nums[i] represents the score of the ith student, with an integer k. Pick the scores of any k students from the array so that the difference between the highest and the lowest of the k scores is minimized. Return the minimum possible difference.

22. Binary Tree Preorder Traversal LeetCode : 🌳👈👉
    Given the root of a binary tree, return the preorder traversal of its nodes' values.

23. Maximum Average Subarray I LeetCode : ⏫⏳
    Given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average value and return this value. Any answer with a calculation error less than 10-5 will be accepted.

24. Same Tree LeetCode : 🌳🌳
    Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.

25. Contains Duplicate II LeetCode : 🔍🔎
    Given an integer array nums and an integer k, return true if there are two distinct indices iand j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

26. Minimum Time to Collect All Apples in a Tree LeetCode : 🍎🏃
    Given an undirected tree consisting of n vertices numbered from 0 to n-1, which has some apples in their vertices. You spend 1 second to walk over one edge of the tree. Return the minimum time in seconds you have to spend to collect all apples in the tree, starting at vertex 0 and coming back to this vertex.

27. Intersection of Two Arrays LeetCode : ⋂
    Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

28. Number of Nodes in the Sub-Tree With the Same Label LeetCode : 🌳🔍🎨
    Given a tree with n nodes labeled by lower-case characters. Each node has a label specified in the string labels, and the edges of the tree are given in the array edges. The task is to return an array of size n, where each element is the number of nodes in the subtree of the corresponding node that have the same label as the node itself.

29. Max Consecutive Ones III LeetCode : 📈1️⃣
    Given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0's.

30. Longest Path With Different Adjacent Characters LeetCode : 🌲🛣️🌳
    Given a tree represented by an array and a string, find the longest path in the tree such that no two adjacent nodes on the path have the same character assigned to them.

31. Grumpy Bookstore Owner LeetCode : 😠📚
    Given an array customers and an array grumpy, where grumpy[i] is 1 if the bookstore owner is grumpy during the ith minute and 0 otherwise. The bookstore owner knows a secret technique to keep themselves not grumpy for a certain number of minutes, but can only use it once. Return the maximum number of customers that can be satisfied throughout the day.

32. Lexicographically Smallest Equivalent String LeetCode : 📝📊🔤
    Given two strings of the same length s1 and s2 and a string baseStr, using the equivalency information from s1 and s2, return the lexicographically smallest equivalent string of baseStr.

33. Best Time to Buy and Sell Stock LeetCode : 💰📈📉
    Maximize profit by buying and selling a stock on different days, return max profit or 0 if none.

34. Number of Good Paths LeetCode : 🛣️
    Find the number of good paths in a tree, where a good path starts and ends at nodes with the same value and all nodes in between have values less than or equal to the starting node's value. The input is an array of node values and an array of edges representing the tree structure.

35. Number of Arithmetic Triplets LeetCode : 🔢📊
    Find the number of unique arithmetic triplets (i, j, k) in a strictly increasing integer array where nums[j] - nums[i] == diff and nums[k] - nums[j] == diff.

36. Insert Interval LeetCode : ⬇️⌛
    The task is to insert a new interval into a given sorted array of non-overlapping intervals and merge any overlapping intervals if necessary, while keeping the array sorted.

37. Flipping an Image LeetCode : 👆👇
    Given an n x n binary matrix image, flip the image horizontally, then invert it, and return the resulting image.
    E.g. [1,1,0] -> [0,1,1] -> [1,0,0]

38. Flip String to Monotone Increasing LeetCode : 0️⃣1️⃣📈
    Given a binary string, flip the least number of times to make it monotone increasing (consists of 0's followed by 1's) and return that count.

39. Find First Palindromic String in the Array LeetCode : 🔍🔁
    Given an array of strings words, return the first palindromic string in the array. If there is no such string, return an empty string "".

40. Maximum Sum Circular Subarray LeetCode : 🔝💰🌀
    Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums.

41. Maximum Count of Positive Integer and Negative Integer LeetCode : 📊
    Get the maximum count of positive and negative integers in a given array and return the maximum count.

42. Binary Search LeetCode : 1️⃣➗2️⃣
    Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

43. Subarray Sums Divisible by K LeetCode : 🔢🔍
    Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k. A subarray is a contiguous part of an array.

44. Count Number of Nice Subarrays LeetCode : 🧮📊
    Given an array of integers nums and an integer k. A continuous subarray is called nice if there are k odd numbers on it. Return the number of nice sub-arrays.

45. Non-decreasing Subsequences LeetCode : 📈
    Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements. You may return the answer in any order.

46. Sum of All Subset XOR Totals LeetCode : ⨁
    Given an array of integers, return the sum of XOR of all subsets. Count subsets with same elements multiple times.

47. Restore IP Addresses LeetCode : 🛠️🌐
    A valid IP address consists of 4 integers between 0 and 255, separated by dots, no leading zeros. Given a string of digits, return all possible valid IP addresses that can be formed by inserting dots, no reordering or removing digits in the string.

48. Palindrome Partitioning LeetCode : 🔄🔨🧱
    Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

49. Assign Cookies LeetCode : 🍪
    You want to give your children cookies, with each child getting at most one. Each child has a "greed factor" for cookie size, and you have cookies of various sizes. You want to assign the cookies to the children to make the most content children.

50. Minimum Common Value LeetCode : 📜🔘📃
    Given two sorted integer arrays, return minimum common integer from sorted arrays nums1 and nums2, or -1 if none.

51. Find the Town Judge LeetCode : 🏛️
    Find the town judge among n people, using trust array trust[i]=[ai, bi]. Return their label if they trust no one and are trusted by everyone except themselves, else return -1.

52. Predict the Winner LeetCode : 🏆
    Given an integer array nums, two players take turns choosing numbers from either end of the array, adding to their score until the array is empty. Return true if Player 1 can win assuming optimal play.

53. Snakes and Ladders LeetCode : 🐍🎲🪜
    Find the minimum number of moves to reach the end of a snakes and ladders board where each cell is labeled in a Boustrophedon style. The algorithm uses breadth-first search and returns -1 if the end cannot be reached.

54. Find Closest Node to Given Two Nodes LeetCode : 🎱↔️⭕
    Given a directed graph with n nodes, represented by an array of edges and two starting nodes, find the closest node that can be reached from both nodes with minimized maximum distance. If multiple answers, return smallest index. Return -1 if no possible answer.

55. Reverse Linked List LeetCode : 🔙🔗📜
    Given the head of a singly linked list, reverse the list, and return the reversed list.

56. Cheapest Flights Within K Stops LeetCode : ✈
    Find the cheapest route from src to dst with at most k stops among n cities connected by flights, return -1 if no such route exists.

57. Roman to Integer LeetCode : ➡️🔢
    Given a roman numeral, convert it to an integer. Roman numerals have 7 symbols: I, V, X, L, C, D, M. Each symbol represents a different value. The algorithm for converting Roman numerals to integers is adding together the values of each symbol, handling special cases of subtraction such as IV and IX.

58. Missing Number LeetCode : ❓
    Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

59. Concatenated Words LeetCode : ▶️⏩
    Given an array of strings words (without duplicates), return all the concatenated words in the given list of words. A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the given array.

60. Data Stream as Disjoint Intervals LeetCode : 📊📈🔳🔲
    Implement a SummaryRanges class that can: Initialize with an empty stream, add integers to the stream and return a summary of the integers in the stream as a list of disjoint intervals, sorted by start interval.

61. Closest Prime Numbers in Range LeetCode : 3️⃣⏩5️⃣
    Find the closest prime numbers between left and right, where closest is defined as minimum difference between the two prime numbers. Return the pair as an array or [-1, -1] if no such pair exists. Prime numbers are defined as numbers only divisible by 1 and themselves.

62. LFU Cache LeetCode : 💾
    Design and implement a LFU cache data structure. Implement the LFUCache class with get and put methods that have O(1) time complexity.

63. Sqrt(x) LeetCode : 🧮🔢
    Find square root of x rounded down to nearest integer. No built-in functions or operators allowed.

64. Happy Number LeetCode : 😊
    Determine if a number is happy by summing its digits' squares and repeating until 1 or an endless cycle. Return true if it ends in 1, false otherwise.

65. N-th Tribonacci Number LeetCode : 🔢🔄
    The Tribonacci sequence is defined as: T₀ = 0, T₁ = 1, T₂ = 1, T_n+3 = T_n+T_n+1+T_n+2 for n >= 0. Given n, return T_n.

66. Climbing Stairs LeetCode : 🪜
    You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

67. Best Team With No Conflicts LeetCode : 🏆⚽️💪
    You're a basketball manager. For a tournament, you want to pick the team with the highest score by summing the scores of all players. Conflicts occur when a younger player has a higher score than an older player. Choose the best team with no conflicts using lists of player scores and ages.

68. Fizz Buzz LeetCode : 💥🔊
    Return a string array of "FizzBuzz" if i is divisible by 3 & 5, "Fizz" if divisible by 3, "Buzz" if divisible by 5, or i (as string) for all i from 1 to n, indexed 1-based.

69. Greatest Common Divisor of Strings LeetCode : 📈➗️🔡
    Find largest string x that divides both str1 and str2. If t divides s, s = t + ... + t (t repeated one or more times).

70. Power of Three LeetCode : 💡️⚡️3️⃣
    Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there exists an integer x such that n == 3x.

71. Zigzag Conversion LeetCode : ⚡💭
    Write code to convert string "PAYPALISHIRING" to "PAHNAPLSIIGYIR" using zigzag pattern given number of rows: string convert(string s, int numRows)

72. Permutation in String LeetCode : 🔄🧵
    Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1's permutations is the substring of s2.

73. Find All Anagrams in a String LeetCode : 🔍🔀🔤
    Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

74. Fruit Into Baskets LeetCode : 🍇🍉🍎🛍️
    Two baskets are given to collect fruit from a row of trees, represented by an array fruits. Each basket can only hold one type of fruit, with no limit on the amount. You must pick one fruit from each tree as you move from left to right, and stop when you reach a fruit that won't fit in the baskets. The goal is to pick the maximum number of fruits.

75. Jump Game II LeetCode : 🏃‍♂️🎮2️⃣
    Given a 0-indexed array nums of length n, starting at nums[0]. Each nums[i] is the max jump length from i to i + j (where 0 <= j <= nums[i] and i + j < n). Return minimum number of jumps to reach nums[n - 1]. Assumed to always have a solution.

76. Naming a Company LeetCode : 📝💡🏢
    Given an array of strings ideas representing company names, find the number of distinct names formed by swapping the first letters of two names and concatenating them if they are not in the original ideas list.

77. As Far from Land as Possible LeetCode : 🌊🏃‍♂️🏝️
    Find max Manhattan distance from water cell to nearest land cell in an n x n grid of 0s (water) and 1s (land). Return distance or -1 if no water or land exists.

78. Intersection of Two Arrays II LeetCode : 🔗2️⃣🧮
    Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.

79. Binary Tree Inorder Traversal LeetCode : 🌳
    Given the root of a binary tree, return the inorder traversal of its nodes' values.

80. Add Binary LeetCode : 1️⃣➕0️⃣
    Given two binary strings a and b, return their sum as a binary string.

81. Add to Array-Form of Integer LeetCode : 📊➕🔢
    Given an integer array num representing digits of an integer. Add another integer k to num and return the sum of both integers as an array of digits in left-to-right order.

82. Minimum Distance Between BST Nodes LeetCode : 🌳🔍📏
    Given the root of a Binary Search Tree (BST), return the minimum difference between the values of any two different nodes in the tree.

83. Invert Binary Tree LeetCode : 🌳🔄💻
    Given the root of a binary tree, invert the tree, and return its root.

84. Binary Tree Zigzag Level Order Traversal LeetCode : 🌳⚡️🚶‍♂
    Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

85. Spiral Matrix LeetCode : 🔁🔢
    Given an m x n matrix, return all elements of the matrix in spiral order.

86. Search Insert Position LeetCode : 🔍⤵️📍
    Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. The runtime complexity of the algorithm must be O(log n).

87. Single Element in a Sorted Array LeetCode : 💡1️⃣🧐🔢
    Given a sorted array of integers where all elements appear twice, except for one element that appears once, return the single element. The solution must have a time complexity of O(log n) and a space complexity of O(1).

88. Single Number LeetCode : 🔢🤔1️⃣
    Find the unique number in an array of integers where every element appears twice, except for one. The solution must have a linear runtime complexity and use only constant extra space.

89. Capacity To Ship Packages Within D Days LeetCode : 🚢📦🕑
    A conveyor belt has packages with weights that must be shipped within days. We load the ship each day with packages in the order given by weights, but can't exceed the maximum weight capacity of the ship. Find the least weight capacity needed to ship all packages within the given timeframe.

90. Pascal's Triangle LeetCode : 🧑‍🔬🔢🔺
    Given an integer numRows, return the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it.

91. Valid Anagram LeetCode : 🔤🔁🔡✅
    Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

92. Valid Parentheses LeetCode : ✅ ( ) [ ] { }
    Check if a string of brackets is valid by verifying that they are correctly opened and closed in the right order and that each opening bracket has a corresponding closing bracket.

93. Basic Calculator II LeetCode : 🧮
    Given a string s which represents an expression, evaluate this expression and return its value. The integer division should truncate toward zero.

94. Edit Distance LeetCode : 🔤✂️🔡
    Given two strings, return the minimum number of operations to convert one to the other using insert, delete, or replace operations on characters.

95. String to Integer (atoi) LeetCode : 🧵➡️🔢
    The myAtoi function converts a string to a 32-bit signed integer by removing leading whitespace, reading an optional sign, extracting digits until the end of the input or a non-digit character, converting them to an integer, and clamping it if it's out of range. Return the integer as the final result.

96. Number of Islands LeetCode : 🌊🏝️🌊
    Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

97. Number of Islands LeetCode : 🔁🔗📜
    Given the head of a singly linked list, return true if it is a palindrome or false otherwise.

98. Convert Sorted Array to Binary Search Tree LeetCode : 🔢💻🌳
    Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

99. Symmetric Tree LeetCode : 🌳👀🌳
    Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

100. Binary Tree Level Order Traversal LeetCode : 🌳🔢📊
     Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).