Next Swe - nextswe

Back to FAANG Preparation Journey (Now MAANG Preparation Journey)

I had to take some time off from my regular FAANG preparation journey. A lot has happened during this period of time. I became father again. Now, I am the father of one sweetest little girl and one cutest little boy. Although last time

bit-manipulation

LeetCode 136. Single Number ~ Intuition & Solution

https://leetcode.com/problems/single-number/ Problem statement: Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input:

problem solving

Cycle or Loop Detection in a LinkedList ~ find the start of the loop

Finding a loop in LinkedList. To check whether a LinkedList has a loop or not is pretty straightforward. But, it becomes trickier when it comes to finding the start of the loop of a LinkedList. Let's first address, how can we tell whether a

problem solving

LeetCode 442. Find All Duplicates in an Array ~ Intuition & Solution

https://leetcode.com/problems/find-all-duplicates-in-an-array/ Problem statement: Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements that appear twice in this array. Could you do it without extra

problem solving

LeetCode 1508. Range Sum of Sorted Subarray Sums ~ Intuition & Solution

https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/ Based on this intuition, try solving on our own before looking at the code.Problem statement: Given the array nums consisting of n positive integers. You computed the sum of all non-empty continous subarrays from the array and then

problem solving

LeetCode 890. Find and Replace Pattern ~ Intuition & Solution

https://leetcode.com/problems/find-and-replace-pattern/ Based on this intuition, try solving on our own before looking at the code.We are given ["abc","deq","mee","aqq","dkd","ccc"] these words and a pattern = "abb" . Our desired output should be: ["mee","aqq"] so, a -&

problem solving

LeetCode 41. First Missing Positive ~ Intuition & Solution

https://leetcode.com/problems/first-missing-positive/ Based on this intuition, try solving on our own before looking at the code.If we have an array of length n we know "smallest missing positive integer" must be in between 1 and n+1(inclusive). For example:

problem solving

LeetCode 172. Factorial Trailing Zeroes ~ Intuition & Solution

https://leetcode.com/problems/factorial-trailing-zeroes/ Based on this intuition, try solving on our own before looking at the code.How can we tell from a number, how many trailing zeroes are at the end? 10 = 10 1200 = 12 x 10 x 10 145000 = 145