ullas kunder blog

Blogs
Contact
Projects
Visitor

All js dom react hooks guide markdown basic p5 dsa git github c++lib array regx advance stack ts nextjs mdx rss dev.to blog next-api ssr seo cms algorithms arrays prefixsum python javascript subarray brute-force interview hashmap optimal coding nodejs automation blogging productivity JavaScript debounce throttle event handling performance optimization search input scroll events requestAnimationFrame modern JavaScript Javascript event-loop task-queue microtasks macrotasks async call-stack execution-context web-development beginner-guide twopointer string slidingwindow PostgreSQL PostgreSQL Password Reset PostgreSQL Windows Reset Database Password Postgres Security Database Administration psql Tutorial PowerShell PostgreSQL PostgreSQL 17 slicing lists strings go wails system-tray desktop-app background-task goroutines trees graph-theory bfs dfs graphs search bst binary-search leetcode recursion intervals sliding-window linked-list heap divide-and-conquer graph flutter firebase mobileapp ai system-design rapid-prototyping dynamic-programming

LeetCode 300: Longest Increasing Subsequence
Mastering the LIS problem with Dynamic Programming and Binary Search optimization.
Apr 25, 2026
LeetCode 417: Pacific Atlantic Water Flow
Mastering graph traversal by thinking backwards: How to find cells that flow to both oceans using BFS.
Apr 22, 2026
LeetCode 23: Merge k Sorted Lists
Master the art of merging multiple sorted linked lists using Min-Heaps and Divide & Conquer strategies.
Apr 21, 2026
LeetCode 239: Sliding Window Maximum
Master the Monotonic Deque approach to efficiently track the maximum value in a sliding window.
Apr 20, 2026
LeetCode 57: Insert Interval – Efficient Merging
Master the art of merging intervals with a clean, three-phase linear approach.
Apr 19, 2026
Binary Search Tree (BST) Concept and Operations
The data structure that keeps itself sorted — automatically.
Apr 17, 2026
Traversal Algorithms: Navigating Trees and Graphs with BFS and DFS
Mastering Breadth-First and Depth-First Search.
Apr 16, 2026
What is a Tree in DSA?
Understanding the "Why" behind the most fundamental data structure.
Apr 15, 2026
solve leetcode Reverse an Array
Learn how to reverse an array efficiently using brute force and optimal approaches in Python and JavaScript.
Oct 1, 2025
solve leetcode find minimum and maximum in an array
Learn how to efficiently find the smallest and largest elements in an array using simple and optimal techniques in Python and JavaScript.
Oct 1, 2025
solve leetcode Rotate an array to the right by k steps
Learn how to rotate an array efficiently using the reverse approach in Python and JavaScript with step-by-step explanation.
Oct 1, 2025
Two Sum – Brute Force vs Hashing
Solve the classic Two Sum problem using brute-force and optimized hashing techniques, a must-know algorithm for coding interviews.
Sep 23, 2025
Longest Substring Without Repeating Characters – Sliding Window
Learn how to efficiently find the longest substring with unique characters using sliding window and hashmap in Python and JavaScript.
Sep 23, 2025
Check if a Subarray with Zero Sum Exists – Prefix Sum in Action
Understand how to check for a zero-sum subarray using both brute-force and prefix sum techniques, with step-by-step code in Python and JavaScript.
Jun 26, 2025
Find Pair with Given Sum in an Array – Brute-force and Optimal Approaches
Explore how to find two elements in an array that sum up to a target value using brute-force and hash map techniques in both Python and JavaScript.
Jun 26, 2025
Print All Zero-Sum Subarrays – From Brute-Force to Prefix Hashing
Explore how to find and print all subarrays that sum to zero using both brute-force and efficient prefix-sum + hashmap techniques in Python.
Jun 26, 2025