Saravana Sai saravanasai.hashnode.dev·9 hours agoLeetCode Minimum Path Sum Explained: A Dynamic Programming ApproachIntroduction The "Minimum Path Sum" problem is a classic dynamic programming challenge commonly found on platforms like LeetCode. In this blog post, we will walk through the solution to the "Minimum Path Sum" problem step by step, using a dynamic pro...Discussleetcode-solution
Vasant Mestryvasantmestry.hashnode.dev·Nov 7, 2024Day 2 of 30 days of JavaScript ChallengeHello guys welcome back to new series of JavaScript, where we‘ll be solving 30 days of JavaScript Questions from LeetCode. Here is link of all the problems In this series, we'll tackle each question one by one. I'll guide you by providing solutions a...Discuss30 days of JavaScript LeetcodeJavaScript
Vasant Mestryvasantmestry.hashnode.dev·Nov 6, 2024Day 1 of 30 Days JavaScript ChallengeHellooo guys, welcome back to new series of JavaScript, where we‘ll be solving 30 days of JavaScript Questions from Leetcode. Here is link of all the problems In this series, we'll tackle each question one by one. I'll guide you by providing solutio...Discuss·1 like30 days of JavaScript Leetcode30 Days of Code
Ravi Kumarravikr126.hashnode.dev·Nov 4, 2024Kadane's Algorithms for FAANG interviewsLet's talk about the most popular and most asked interview questions. 👉 𝐅𝐢𝐧𝐝 𝐭𝐡𝐞 𝐦𝐚𝐱𝐢𝐦𝐮𝐦 𝐬𝐮𝐦 𝐨𝐟 𝐚 𝐜𝐨𝐧𝐭𝐢𝐠𝐮𝐨𝐮𝐬 𝐬𝐮𝐛𝐚𝐫𝐫𝐚𝐲. So how do you solve this question? 🤔So many approaches are there, but the most popular ...Discussdata structures
shohanur rahmanshohan777.hashnode.dev·Nov 2, 2024Leetcode 233 (Number of Digit One) was fun.This one is a math problem. And I enjoyed every bit of cracking the equation. The problem was, “Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.” At first I thought of doing recursi...Discussleetcode
KiwiChipkiwicodenest.hashnode.dev·Nov 2, 2024Linked List Exercise (2) - Linked List Cyclehttps://leetcode.com/problems/linked-list-cycle/description/ Entire Code # Definition for singly-linked list. class Node(object): def __init__(self, value): self.value = value self.next = None def create_linked_list(values): ...DiscussPython Algorithm Study JournalPython
KiwiChipkiwicodenest.hashnode.dev·Nov 1, 2024Linked List Exercise (1) - Middle of the linked listLeetcode - middle of the linked list (URL) Entire code class Node: def __init__(self, value): self.value = value self.next = None class LinkedList: def __init__(self, value): new_node = Node(value) self.head...DiscussPython Algorithm Study JournalPython
Enoch OlutunmidaProwww.thatsametechguy.com·Oct 26, 2024Deleting the Middle Node of a Linked List Using the Tortoise and Hare Algorithm in TypeScriptIntroduction In this post, we’ll be solving LeetCode Problem 2095: “Delete the Middle Node of a Linked List.” The problem statement on LeetCode is: You are given the head of a linked list. Delete the middle node and return the head of the modified l...Discuss·1 like·33 readsleetcode
Susan Odiisusanodii.hashnode.dev·Oct 16, 2024Day 5: Apply Transform Over Each Element in Array — 30 days of LeetCode challenge.Problem Given an integer array arr and a mapping function fn, return a new array with a transformation applied to each element. The returned array should be created such that returnedArray[i] = fn(arr[i], i). Please solve it without the built-in Arra...Discuss·10 likesleetcode-solution
Ved Asoleblog.vedasole.cloud·Oct 14, 2024Leetcode 13 — Roman to IntegerQuestion Link : Roman to Integer Problem Statement : Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol ValueI 1V 5X 10L 50C 100D 500...DiscussLeetcode DSA Solutionsleetcode
