Sean Coughlinblog.seancoughlin.me·20 hours agoMastering LeetCode: Evaluating Reverse Polish Notation with PythonIntroduction to Reverse Polish Notation Reverse Polish Notation (RPN) is a mathematical notation in which every operator follows all of its operands. This format eliminates the need for parentheses that are required by infix notation. For example, th...DiscussSWE Interview Preparationleetcode
Sean Coughlinblog.seancoughlin.me·21 hours agoMastering the Challenge: Solve 'Longest Substring Without Repeating Characters' on LeetCodeIntroduction to 'Longest Substring Without Repeating Characters' When preparing for software engineering interviews, understanding how to tackle problems involving strings is crucial. Today, I'll walk you through the problem of finding the longest su...DiscussSWE Interview Preparationleetcode
Sean Coughlinblog.seancoughlin.me·a day agoMastering the Clone Graph Problem on LeetCode: A Comprehensive GuideIntroduction to the Clone Graph Problem In graph theory, cloning or making a deep copy of a graph (LeetCode 133 Clone Graph) is a fundamental challenge, especially in coding interviews where understanding data structures is crucial. The problem is ty...DiscussSWE Interview Preparationleetcode
Umang Srivastavaoutlierchronicles.hashnode.dev·May 6, 20242487. Remove Nodes From Linked ListProblem Statement You are given the head of a linked list. Remove every node which has a node with a greater value anywhere to the right side of it. Return theheadof the modified linked list. Examples Example 1: Input: head = [5,2,13,3,8] Output: [13...Discuss·10 likesLeetCode Dailyleetcode
Kallol Bairagikallolbairagi.hashnode.dev·May 6, 2024DP #120 Triangleclass Solution { public int minimumTotal(List<List<Integer>> triangle) { // int r=triangle.size(); // int[][] dp=new int[r][r]; // for(int[] i:dp)Arrays.fill(i,-1); // int ans=(int)Math.pow(10,9); // for(in...DiscussDynamic-Programming-BeastDSA
Umang Srivastavaoutlierchronicles.hashnode.dev·May 5, 2024237. Delete Node in a Linked ListProblem Statement There is a singly-linked list head and we want to delete a node node in it. You are given the node to be deleted node. You will not be given access to the first node of head. All the values of the linked list are unique, and it is g...Discuss·1 likeLeetCode Dailyleetcode
Chetan Dattachetan77.hashnode.dev·May 5, 2024410. Split Array Largest SumProblem Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. A subarray is a contiguous part of the array. (link) Ex...DiscussLeetcodesplit-array-largest-sum
Umang Srivastavaoutlierchronicles.hashnode.dev·May 2, 2024746. Min Cost Climbing StairsUsing python and go Problem Statement You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the step with index 0, or the step...Discuss·15 likesRecursionPython
naruto luffynarutoluffy.hashnode.dev·May 2, 20242441. Largest Positive Integer That Exists With Its Negative(leetcode)Given an integer array nums that does not contain any zeros, find the largest positive integer k such that -k also exists in the array. Return the positive integerk. If there is no such integer, return -1. Example 1: Input: nums = [-1,2,-3,3] Output:...Discussleetcode
Umang Srivastavaoutlierchronicles.hashnode.dev·May 1, 20242441. Largest Positive Integer That Exists With Its NegativeProblem Statement Given an integer array nums that does not contain any zeros, find the largest positive integer k such that -k also exists in the array. Return the positive integer k. If there is no such integer, return -1. Examples Example 1: Input...Discuss·20 likesLeetCode DailyPython