Software Development

Pages

  • Home
  • About
  • Contact

Sunday, November 29, 2020

Meet in the Middle

 



Posted by bparanj at Sunday, November 29, 2020
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Newer Post Older Post Home

Popular Posts

Blog Archive

  • ►  2025 (1)
    • ►  April (1)
  • ►  2024 (2)
    • ►  December (2)
  • ►  2023 (124)
    • ►  October (1)
    • ►  September (2)
    • ►  June (3)
    • ►  May (6)
    • ►  April (10)
    • ►  March (49)
    • ►  February (51)
    • ►  January (2)
  • ►  2022 (34)
    • ►  December (6)
    • ►  November (2)
    • ►  September (4)
    • ►  August (1)
    • ►  July (1)
    • ►  June (11)
    • ►  May (4)
    • ►  April (1)
    • ►  February (4)
  • ►  2021 (39)
    • ►  December (1)
    • ►  November (6)
    • ►  September (1)
    • ►  August (10)
    • ►  July (1)
    • ►  May (1)
    • ►  March (8)
    • ►  February (2)
    • ►  January (9)
  • ▼  2020 (355)
    • ►  December (9)
    • ▼  November (197)
      • Edit Distance - Dynamic Programming
      • Data Structure Operations Cheat Sheet
      • Sorting Algorithms Cheat Sheet
      • Look for Similarities Between Problems
      • Eulerian Graphs
      • Longest Increasing Subsequence
      • Binary Search in a Cyclic Sequence
      • The Knapsack Problem
      • Finding the Maximum Consecutive Subsequence
      • The Skyline Problem
      • The Celebrity Problem
      • The Union Find Problem
      • Recurrence Relations
      • Loop Invariants
      • Trie Structure
      • Graph Coloring
      • Offline Algorithms
      • Lowest Common Ancestor
      • Subtrees and Paths
      • Finding Ancestors in a Tree
      • Successor Graphs
      • Directed Acyclic Graph
      • Topological Sorting
      • Prim's Algorithm
      • Union Find Structure
      • Kruskal's Algorithm
      • Minimum Spanning Tree
      • Binary Trees
      • All Longest Paths
      • Diameter of a Tree
      • Tree Traversal
      • Tree - Leaves and Rooted Tree
      • Data Structure
      • Binary Search
      • Sorting
      • Maximum Subarray Sum
      • Shortest Paths
      • Graph Traversal
      • Segment Tree
      • Graph Coloring
      • Binary Indexed Tree
      • Range Queries
      • Amortized Analysis
      • Dynamic Programming Problem: Edit Distance
      • Knapsack Problems
      • Paths in a Grid
      • Longest Increasing Subsequence
      • Two Uses for Dynamic Programming
      • Minimizing Sums
      • Tasks and Deadlines
      • Scheduling Problems
      • Greedy Algorithms
      • Backtracking
      • Meet in the Middle
      • Generating Permutations
      • Generating Subsets
      • Algorithm Design Techniques
      • Common Complexity Classes
      • How to Create Wireframes
      • What is Data Structure?
      • What is an Algorithm
      • Data Structures and Algorithms
      • Divide and Conquer
      • Data Models and Data Structures
      • Correspondences of Program and Data Structures
      • Longest Common Subsequence
      • All Pairs Shortest Paths
      • Longest Increasing Subsequence
      • Memoization
      • Two Parts of Dynamic Programming
      • Dynamic Programming as a General Purpose Algorithm...
      • Steps for Developing a Dynamic Programming Algorithm
      • Steps in Dynamic Programming
      • Problem Analysis Chart
      • Creating of Binary Trees
      • Binary Tree and Data Files
      • Data Structures
      • How DFS is Related to Backtracking
      • Searching Paths in a Graph
      • Implicit Representation of Graphs
      • Single Source Shortest Path
      • BFS and Shortest Path
      • Modeling using Graph
      • BFS DFS Classification
      • Graph Topics to Master
      • Key to Understanding Dijkstra's Algorithm
      • Greedy vs Dynamic Programming
      • Greedy Algorithms
      • Leetcode vs IK
      • Table Lookup Technique
      • Indicators
      • Accumulating
      • Incrementing
      • Accumulators
      • Decision Tables
      • Analyzing the Problem
      • Minimum Edit Distance Dynamic Programming Problem
      • Modeling Processes with Two Possible Outcomes
      • Problem Solving and Programming Concepts
      • Model Development and Abstract Levels
    • ►  October (1)
    • ►  September (10)
    • ►  August (19)
    • ►  July (30)
    • ►  June (32)
    • ►  May (32)
    • ►  April (3)
    • ►  March (1)
    • ►  February (5)
    • ►  January (16)
  • ►  2019 (17)
    • ►  December (2)
    • ►  June (1)
    • ►  April (1)
    • ►  March (4)
    • ►  February (6)
    • ►  January (3)
  • ►  2018 (70)
    • ►  December (4)
    • ►  November (12)
    • ►  October (5)
    • ►  September (7)
    • ►  July (20)
    • ►  June (8)
    • ►  April (1)
    • ►  March (4)
    • ►  February (5)
    • ►  January (4)
  • ►  2017 (116)
    • ►  December (2)
    • ►  November (5)
    • ►  October (3)
    • ►  September (3)
    • ►  August (13)
    • ►  July (17)
    • ►  June (5)
    • ►  May (17)
    • ►  April (10)
    • ►  March (7)
    • ►  February (20)
    • ►  January (14)
  • ►  2016 (436)
    • ►  December (29)
    • ►  November (16)
    • ►  October (166)
    • ►  September (14)
    • ►  August (25)
    • ►  July (32)
    • ►  June (42)
    • ►  May (39)
    • ►  April (20)
    • ►  March (31)
    • ►  February (12)
    • ►  January (10)
  • ►  2015 (240)
    • ►  December (21)
    • ►  November (18)
    • ►  October (42)
    • ►  September (61)
    • ►  August (7)
    • ►  July (5)
    • ►  June (49)
    • ►  May (6)
    • ►  April (13)
    • ►  March (3)
    • ►  February (10)
    • ►  January (5)
  • ►  2014 (75)
    • ►  December (2)
    • ►  November (13)
    • ►  October (1)
    • ►  September (4)
    • ►  August (9)
    • ►  July (17)
    • ►  June (7)
    • ►  May (5)
    • ►  April (3)
    • ►  March (8)
    • ►  February (2)
    • ►  January (4)
  • ►  2013 (86)
    • ►  December (5)
    • ►  November (1)
    • ►  October (10)
    • ►  September (8)
    • ►  August (4)
    • ►  July (4)
    • ►  June (1)
    • ►  May (16)
    • ►  April (10)
    • ►  March (4)
    • ►  February (11)
    • ►  January (12)
  • ►  2012 (79)
    • ►  December (7)
    • ►  November (4)
    • ►  October (9)
    • ►  September (1)
    • ►  August (5)
    • ►  July (2)
    • ►  June (3)
    • ►  May (7)
    • ►  April (29)
    • ►  March (3)
    • ►  February (2)
    • ►  January (7)
  • ►  2011 (47)
    • ►  December (3)
    • ►  November (2)
    • ►  October (4)
    • ►  September (3)
    • ►  August (3)
    • ►  July (4)
    • ►  June (4)
    • ►  May (4)
    • ►  April (14)
    • ►  March (2)
    • ►  February (2)
    • ►  January (2)
  • ►  2010 (42)
    • ►  November (1)
    • ►  September (7)
    • ►  August (2)
    • ►  July (8)
    • ►  June (3)
    • ►  May (1)
    • ►  April (9)
    • ►  March (3)
    • ►  February (7)
    • ►  January (1)
  • ►  2009 (16)
    • ►  October (1)
    • ►  September (2)
    • ►  August (3)
    • ►  July (5)
    • ►  April (1)
    • ►  March (1)
    • ►  February (2)
    • ►  January (1)
  • ►  2008 (55)
    • ►  December (2)
    • ►  November (6)
    • ►  October (3)
    • ►  September (2)
    • ►  August (3)
    • ►  July (3)
    • ►  June (7)
    • ►  May (1)
    • ►  April (12)
    • ►  March (7)
    • ►  February (4)
    • ►  January (5)
  • ►  2007 (123)
    • ►  December (25)
    • ►  November (7)
    • ►  October (20)
    • ►  September (5)
    • ►  August (4)
    • ►  July (11)
    • ►  June (28)
    • ►  May (5)
    • ►  April (8)
    • ►  March (3)
    • ►  February (5)
    • ►  January (2)
  • ►  2006 (32)
    • ►  December (3)
    • ►  November (15)
    • ►  October (9)
    • ►  July (2)
    • ►  June (1)
    • ►  February (2)
  • ►  2005 (10)
    • ►  October (2)
    • ►  September (1)
    • ►  March (2)
    • ►  January (5)
  • ►  2004 (12)
    • ►  December (12)

About Me

bparanj
View my complete profile

Total Pageviews
Awesome Inc. theme. Powered by Blogger.