Skip to main content

#Algorithms

Browse articles tagged with #Algorithms

  • DSA Problems

    Flood Fill Algorithm Implementation and Analysis

    Complete Java solution for flood fill algorithm with BFS/DFS approaches, time complexity analysis, and practical implementation considerations for FAANG interviews.

  • DSA Problems

    Convert Sorted Array to Binary Search Tree

    Learn to convert a sorted array into a height-balanced binary search tree using divide-and-conquer approach with O(n) time and space complexity.

  • DSA Problems

    Delete Node in a BST

    Learn how to delete a node from a Binary Search Tree while maintaining BST properties and optimal time complexity.

  • DSA Problems

    Validate Binary Search Tree Algorithm Solution

    Complete Java implementation to validate if a binary tree is a valid BST with optimal time and space complexity considerations.

  • DSA Problems

    Path Sum II Java Solution with DFS and Backtracking

    Complete Java implementation for Path Sum II problem with detailed explanation of DFS approach and backtracking techniques for finding all root-to-leaf paths with target sum.

  • DSA Patterns

    Find Kth Smallest Element in BST

    Learn to efficiently find the kth smallest element in a binary search tree using inorder traversal and iterative approaches.

  • DSA Problems

    Implement Stack using Queues

    Learn to implement a LIFO stack data structure using two queues with efficient push and pop operations.

  • DSA Patterns

    In-Place vs Out-of-Place Algorithms in Java

    Comprehensive guide to in-place and out-of-place algorithm design patterns with practical Java implementations and performance trade-offs.

Stay in the Loop

Get curated DSA patterns, coding problems, frontend and backend LLD/HLD, and AI/ML System Design insights delivered straight to your inbox. No spam, just focused interview and engineering content.