- DSA Patterns
Median from Data Stream - Streaming Statistics Problem
Learn to efficiently find median values from a continuous data stream using two heaps for optimal time and space complexity.
- DSA Problems
Basic Calculator Implementation and Evaluation
Complete Java solution for basic calculator with stack-based evaluation, handling parentheses and operator precedence.
- DSA Patterns
Merge K Sorted Lists Algorithm Solution
Complete Java implementation of merging k sorted linked lists using priority queue and divide-and-conquer approaches with time and space complexity analysis.
- DSA Problems
Largest Rectangle in Histogram Algorithm Solution
Complete Java implementation for finding the largest rectangular area in a histogram with optimal time and space complexity analysis.
- DSA Patterns
Subtree of Another Tree Algorithm Solution
Complete Java implementation for checking if one binary tree is a subtree of another, including multiple approaches and time complexity analysis.
- DSA Problems
Car Fleet Problem Solution | Java Implementation for Traffic Flow Analysis
Complete Java solution for the Car Fleet problem analyzing traffic flow with stack-based approach and time complexity analysis.
- DSA Problems
Daily Temperatures Problem Solution
Complete Java implementation for daily temperatures problem with stack-based approach and optimal time complexity analysis.
- DSA Patterns
Tree Path Sum Problems in Java: DFS and BFS Solutions
Comprehensive guide to solving tree path sum problems using DFS and BFS traversal techniques with optimal time and space complexity analysis.
- DSA Problems
Evaluate Reverse Polish Notation with Stack Data Structure
Learn to evaluate Reverse Polish Notation expressions using a stack-based approach in Java with O(n) time and space complexity.
- DSA Patterns
Lowest Common Ancestor in Binary Trees and Graphs
Comprehensive Java solution for finding the lowest common ancestor in binary trees, including iterative and recursive approaches with time complexity analysis.
- DSA Problems
Design a Min Stack with O(1) Time Complexity
Learn to implement a min stack that supports push, pop, and getMin operations in constant time using auxiliary stack technique.
- DSA Patterns
Binary Tree Diameter and Height Analysis
Complete Java solution for calculating binary tree diameter, height, and balance with optimal time complexity and practical implementation considerations.
#Algorithm
Browse articles tagged with #Algorithm