Swift + DFS + Recursion ✅ ✅ ✅ — Max Area of Island (Leetcode 695) - Difficulty: Link: Day1 : June LeetCode Challenge You are given an m x n binary matrix grid. An island is a group of 1's…theswiftnerd.com You can read the full story on The Swift Nerd blog with the link above. Problem Description You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) …

Stacks + Expressions = Leetcode 150 🚀 🚀 🚀 — Evaluate Reverse Polish Notation (Leetcode 150) - Difficulty: Link: Day 25: May Leetcode Challenge Evaluate the value of an arithmetic expression in Reverse Polish…theswiftnerd.com Read the full story on The Swift Nerd blog with the link above. Problem Description Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, and /. Each operand may be an integer or another expression.

Swift + Pattern Matching = 🧠🛠️🚀 — Find and Replace Pattern (Leetcode 890) - Difficulty: Link: Day 21: May Leetcode Challenge Given a list of strings words and a string pattern, return a list of…theswiftnerd.com Check out the full story on The Swift Nerd blog with the link above. Problem Description Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order.

Traverse Trees with Swift like a Pro 🚀 🚀 🚀 — Binary Tree Level Order Traversal (Leetcode 102) - Difficulty : Link: Day 12: May Leetcode Challenge Given the root of a binary tree, return the level order traversal of…theswiftnerd.com You can read the full story on The Swift Nerd blog with the link above. Problem Description 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).

Solve Leetcode Challenges in Swift like a Pro — Minimum Moves to Equal Array Elements II (Leetcode 462) - Difficulty: Link: Day 19:May Leetcode Challenge Given an integer array nums of size n, return the minimum number of…theswiftnerd.com You can read the full story on The Swift Nerd blog with the link above. Problem Description Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.

Swift + Dynamic Programming = 🔥 🔥 🔥 — Longest String Chain (Leetcode 1048) - Given a list of words, each word consists of English lowercase letters. Let's say word1 is a predecessor of word2 if…theswiftnerd.com If you are preparing for coding interviews, then check the amazing Swift Leetcode series on The Swift Nerd blog. Problem Description Given a list of words, each word consists of English lowercase letters.

Facebook Interview Question 👍 👍 👍 — Valid Number (Leetcode 65) - Difficulty: Link : Day 15: May Leetcode Challenge A valid number can be split up into these components (in order): A…theswiftnerd.com You checkout the full story on The Swift Nerd blog with the link above. Problem Description A valid number can be split up into these components (in order): A decimal number or an integer. (Optional) An 'e' or 'E', followed by an integer.

Swift + Binary Trees + Linked List = Leetcode 114 ✅✅✅ — Flatten Binary Tree to Linked List (Leetcode 114) - Given the root of a binary tree, flatten the tree into a "linked list". The "linked list" should use the same TreeNode…theswiftnerd.com Check the full story on The Swift Nerd blog with the link above. Problem Description Given the root of a binary tree, flatten the tree into a “linked list”:

Merge intervals in Swift like a Pro — Interval List Intersections (Leetcode 986) - Difficulty: Link: Leetcode 986 You are given two lists of closed intervals, firstList and secondList, where…theswiftnerd.com You can read the full story on The Swift Nerd blog along with other interesting ones. Problem Statement You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of intervals is pairwise disjoint and in sorted order.