- Published on
Given a binary tree of size n, find its reverse level order traversal. ie- the traversal must begin from the last level.
All Posts
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
Explainable AI (XAI) aims to make AI systems transparent by providing understandable explanations for their decisions. It enhances trust, accountability, and fairness in AI applications, fostering better adoption and regulatory compliance.- Published on
Delve into the transformative realm of meta-learning, where AI models are trained to learn how to learn, transcending traditional data limitations. Explore recent advancements in few-shot learning, transfer learning, and model-agnostic meta-learning, unveiling the potential for agile, adaptive AI systems across diverse domains.- Published on
This blog covers various aspects such as multimodal AI, agentic AI, open source AI, and the challenges faced by organizations in implementing and scaling AI in business environments.- Published on
Discover the enchanting world of quantum computing through a whimsical journey involving magical cats and super-powered computers! Learn how qubits can revolutionize problem-solving in a fun and easy-to-understand way.