Tagged in

Leetcode

Nerd For Tech

NFT is an Educational Media House. Our mission is to bring the invaluable knowledge and experiences of experts from all over the world to the novice. To know more about us, visit https://www.nerdfortech.org/.

More information

Followers

11.1K

Elsewhere

More, on Medium

Leetcode

Pruthvik Reddy in Nerd For Tech

May 27

Trapping Rain Water — Leetcode 42 [Hard]

Given n non-negative integers representing an elevation map where the width of each bar…

Yu-Cheng (Morton) Kuo in Nerd For Tech

Nov 24, 2023

Leetcode : 605. Can Place Flowers [Array] (Easy)

The Thought Process: From general cases to edge cases

Yu-Cheng (Morton) Kuo in Nerd For Tech

Nov 27, 2023

Leetcode : 525. Contiguous Array [Array] (Medium)

The Thought Process: From general cases to edge cases

Yu-Cheng (Morton) Kuo in Nerd For Tech

Dec 23, 2023

LeetCode: ???. Flower Bouquets [DP] (Medium)

Odd Even Linked List

Problem statement

1 response

Alkesh Ghorpade in Nerd For Tech

Jun 25, 2023

Maximum Gap

Given an integer array nums return the maximum difference between two successive elements in its sorted form.

Problem statement

Alkesh Ghorpade in Nerd For Tech

Jun 29, 2023

Max Sum of Rectangle No Larger Than K

Given a non-empty 2D matrix and an integer k find the max sum of a rectangle in the matrix such that its sum is no larger than k

Problem Statement

Alkesh Ghorpade in Nerd For Tech

Jun 15, 2023

Sudoku Solver

Write a program to solve a Sudoku puzzle by filling in the empty cells.

Trapping Rain Water — Leetcode 42 [Hard]

Leetcode : 605. Can Place Flowers [Array] (Easy)

The Thought Process: From general cases to edge cases

Leetcode : 525. Contiguous Array [Array] (Medium)

The Thought Process: From general cases to edge cases

LeetCode: ???. Flower Bouquets [DP] (Medium)

A classic DP problem

First Missing Positive Integer: Swift

Linked List Cycle: Swift

Odd Even Linked List

Problem statement

Maximum Gap

Given an integer array nums return the maximum difference between two successive elements in its sorted form.

Max Sum of Rectangle No Larger Than K

Given a non-empty 2D matrix and an integer k find the max sum of a rectangle in the matrix such that its sum is no larger than k

Problem Statement

Sudoku Solver

Write a program to solve a Sudoku puzzle by filling in the empty cells.