Vasant Mestryvasantmestry.hashnode.dev·6 hours agoDay 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

Yang Xuprogramlikeabeast.hashnode.dev·a day agoJava for DSA (杀穿Java Coding面试!)⚠️ Unless imported, all of the classes/package in this note are built-in/ready to use Note that the problem-solving function has to be modified with static keyword to be called inside the Solution class without instantiating the class! Review Quizl...DiscussJava

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

Tapan Rachchhtapanrachchh.hashnode.dev·Nov 3, 2024796. Rotate Stringclass Solution: def rotateString(self, s: str, goal: str) -> bool: return len(goal) == len(s) and goal in s * 2DiscussPython

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

Bongi Sibandatrialnerr.hashnode.dev·Nov 1, 2024Solving Best Time to Buy and Sell Stock Leetcode ProblemThis was a problem that I didn’t fully understand the first time I saw it. It took me a while to come up with a brute force solution. So I am very happy that I understand it enough to share not one but TWO solutions with you. https://media.giphy.com/...Discuss·10 likes·41 readsleetcode

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

Arjun Patilbeginners-python-for-leetcode.hashnode.dev·Oct 31, 2024Beginner's Python for LeetcodeA beginners guide to strings and arrays in Python for Leetcode Getting started with leetcode was a rough task for me. I’d open up the site all motivated, hyped to go on a problem solving rampage thinking the “easy” tag actually meant easy. However, I...Discuss·1 likePython

Tapan Rachchhtapanrachchh.hashnode.dev·Oct 30, 20242684. Maximum Number of Moves in a Gridclass Solution: def maxMoves(self, grid: List[List[int]]) -> int: ans = 0 def traverse(a, b, prevVal): nonlocal count, ans if (a, b) in visited: return visited.add((a, b)) ...DiscussPython