- Published on
Divide and conquer is a recursive problem-solving approach that breaks a problem into smaller, more manageable subproblems, solves them individually, and then combines their solutions to solve the original problem.
Algorithms
All Posts
- leetcode (15)
- array (14)
- dynamic-programming (6)
- geeksforgeeks (5)
- data-structures (4)
- sorting (4)
- hash-table (4)
algorithms (3)
- two-pointers (3)
- machine-learning (3)
- ai (3)
- tree (3)
- divide-and-conquer (2)
- stack (2)
- dfs (2)
- heap (2)
- quantum-computing (2)
- matrix (2)
- linked-list (1)
- math (1)
- graph (1)
- greedy-algorithm (1)
- binary-search (1)
- meta-learning (1)
- greedy (1)
- priority-queue (1)
- recursion (1)
- arrays (1)
- binary-search-tree (1)
- striver-dsa-sheet (1)
- prefix-sum (1)
- binary-tree (1)
- queue (1)
- monotonic-stack (1)
- Published on
Dynamic programming is an algorithmic technique that efficiently solves problems by breaking them down into smaller overlapping subproblems and storing the solutions to these subproblems to avoid redundant computations.- Published on
Given a m*n grid with each cell consisting of positive, negative, or zero point. We can move across a cell only if we have positive points. Whenever we pass through a cell, points in that cell are added to our overall points, the task is to find minimum initial points to reach cell (m-1, n-1) from (0, 0) by following these certain set of rules.