Latest YouTube Videos

Recursion is one of the most confusing topics in coding. Many students get "StackOverflowError" and give up. But in this video, I explain Recursion in pure Odia using a simple real-life example from the Puri Jagannath Temple queue. If you struggle to understand how a function calls itself, this video is for you! In this video, you will learn: ✅ What is Recursion? (Explained in Odia) ✅ Real-life example: The "Queue Count" Logic ✅ What is a Base Condition? (And why it stops the loop) ✅ How Stack Memory works in Recursion ✅ Live Coding: Calculating Factorial in Java Related Videos: ▶️ Stack Data Structure Explained: https://youtu.be/lhCKapfJsEE ▶️ Algorithms vs Code: https://youtu.be/0v55bk79pc0 #Recursion #OdiaCoding #DSAinOdia #Java #RabiTalksCode #BPUT #Programming

What is a Node in Data Structures? In this video, I explain the building block of DSA in pure Odia. If you want to understand Linked Lists, Trees, or Graphs, you must first understand the Node. I break down how a Node stores Data and Address (Reference) using simple real-life examples. 🔥 In this video you will learn: What is a Node? (Definition) Structure of a Node (Data field vs. Pointer field) Why we need Nodes in programming. Visual representation of a Node. This is part of my Data Structures and Algorithms (DSA) series in Odia. 🚀 Subscribe for more Coding tutorials in Odia! #DSAinOdia #NodeInDSA #OdiaProgramming #DataStructures #CodingInOdia #OdiaTech #ProgrammingBasics

Most people think an "Algorithm" is a complicated math concept. But actually, simple tasks like making tea or searching for a book are algorithms too! ☕📚 In this video, I explain the core concept of Algorithms without any confusing jargon or math. If you are planning to learn DSA, Coding, or LeetCode, this is the first step you need to take. Key Takeaway: An algorithm is just a plan. Code is how you write that plan. Chapters: 00:00 Intro: What is an Algorithm? 00:47 Algorithm Definition (Step-by-Step Plan) 01:24 Real Life Example (Making Tea/Searching) 02:06 Algorithm vs. Code (The Difference) 02:55 Examples: Two Pointer & Sliding Window 03:49 Conclusion & Outro Question for you: Did this clear your doubts? Let me know in the comments! 👇 #Odia #Algorithm #DSA #CodingForBeginners #ComputerScience #OdiaTech

In this video, we’ll learn the Circular Linked List Data Structure explained simply in Odia. This is the continuation of our Linked List series after Singly and Doubly Linked Lists. You’ll understand what makes a list “circular”, how the last node points back to the first node, and why this structure is used in real systems like music playlists, Round Robin scheduling, and circular queues. What You’ll Learn: • What is a Circular Linked List • Singly Circular vs Doubly Circular Linked List • How insertion works (end insert logic) • How traversal is done without infinite loops • Time complexity overview • Real-life and interview use cases (Round Robin, Josephus Problem) Why Watch This: Circular Linked List completes the Linked List family and is frequently used in interview-style problems. This simple explanation will help you clearly visualize how the circular structure works and how it differs from normal linked lists. Chapters: 00:00 Intro & Recap of Linked List 00:28 Node Structure in Circular List 01:36 What is a Circular Linked List? 02:04 Why use it? (No Null Pointer) 03:04 Insertion Logic Explained 04:00 Dealing with Head & Tail 05:05 Space & Time Complexity 05:40 Outro If this video helps you: • Like and Share • Subscribe to “Rabi Talks Code” for more DSA and Java explained in Odia • Comment which data structure you want next #CircularLinkedList #LinkedList #JavaDSA #OdiaProgramming #RabiTalksCode #CodingInterview #DSAforBeginners

In this video, you’ll learn the Tree Data Structure explained simply in Odia. We’ll understand what a Tree is, why it’s called a non-linear data structure, and how it stores data hierarchically using root, parent, and child nodes. You’ll also learn key terms like leaf node, height, and level, along with different types of trees and traversal techniques (Preorder, Inorder, Postorder, Level Order) with clear visuals. What You’ll Learn: • What is a Tree and how it differs from linear data structures • Root, Parent, Child, and Leaf explained simply • Different types of Trees — General, Binary, and Binary Search Tree • Tree Traversal techniques with examples (height = 2 demo) • Real-life applications of Trees in programming and systems Chapters: 00:00 Intro: Tree vs Linear Data Structures 00:25 Real World Examples (Folder System) 01:21 Terminologies: Parent & Child Nodes 02:06 What is a Root Node? 03:20 Leaf Nodes & Internal Nodes 04:05 Levels & Depth of a Tree 05:12 Height of a Tree Explained 06:00 Types of Trees (Binary, Complete, Full) 08:42 Tree Traversal (In-order, Pre-order, Post-order) 15:53 Summary & Outro Why Watch This: Tree Data Structure is the base for advanced topics like Binary Trees, BSTs, Heaps, and Graphs. By the end of this video, you’ll be able to visualize how trees actually work in memory and easily solve related DSA problems. If this video helps you: • Like 👍 and Share • Subscribe to “Rabi Talks Code” for more DSA and Java tutorials explained in Odia • Comment which data structure you want next #TreeDataStructure #JavaDSA #OdiaProgramming #RabiTalksCode #CodingInterview #BinaryTree #DSAforBeginners

In this video, you’ll understand the Doubly Linked List data structure explained simply in Odia. We’ll see how it’s different from the Singly Linked List and how it allows movement in both directions using previous and next pointers. You’ll also learn how to implement a Doubly Linked List in Java and why it’s used in real-world applications like browser history and music players. What You’ll Learn: • What is a Doubly Linked List • Difference between Singly and Doubly Linked List • How prev and next pointers work • Java implementation and traversal both ways • Time & space complexity and practical uses Why Watch This: Doubly Linked List is an important upgrade to the normal Linked List and appears often in interviews. By the end of this video, you’ll clearly understand its structure and advantages. Chapters: 00:00 Intro: Previous vs Next Pointer 00:43 Structure of Doubly Linked List Node 01:06 The "Previous" Pointer Explained 01:49 Memory Allocation Logic 02:13 Head and Tail Connections 02:47 Complexity & Advantages 03:05 Outro If this video helps you: • Like 👍 and Share • Subscribe to “Rabi Talks Code” for more DSA and Java explained in Odia • Comment which data structure you want next #DoublyLinkedList #JavaDSA #OdiaProgramming #RabiTalksCode #CodingInterview

In this video, we’ll learn about the Linked List Data Structure explained simply in Odia. You’ll understand what a Linked List is, how it works internally, and why it’s different from arrays. We’ll also cover nodes, pointers, head, and traversal, and finally see a Java implementation to make the concept crystal clear. What You’ll Learn: • What is a Linked List and how it works • Node and pointer concept made easy • Linked List vs Array (key differences) • Java implementation and traversal • Common mistakes and interview insights Why Watch This: Linked List is one of the most important and frequently asked topics in coding interviews. By the end of this video, you’ll easily visualize how Linked List stores and connects data dynamically. If this video helps you: • Like 👍 and Share • Subscribe to “Rabi Talks Code” for more DSA and Java explained in Odia • Comment your doubts or suggest the next topic #LinkedList #JavaDSA #OdiaProgramming #RabiTalksCode #CodingInterview

In this video, you’ll learn the Queue Data Structure in the simplest way, explained completely in Odia. We’ll understand what a Queue is, how FIFO (First In First Out) works, and how queues are used in real life — from printer queues to customer service systems. You’ll also see how to implement a Queue in Java and learn enqueue, dequeue, and peek operations with time complexity explained. What You’ll Learn: • What is a Queue and how FIFO works • Real-life examples for easy understanding • Enqueue, Dequeue, and Peek operations in Java • Time and space complexity • Common mistakes and interview tips Why Watch This: Queue is one of the most fundamental data structures in DSA. By the end of this video, you’ll clearly understand how queues store and process data step-by-step. If this video helps you: • Like 👍 and Share • Subscribe to “Rabi Talks Code” for more DSA and Java explained in Odia • Comment which topic you want next #Queue #JavaDSA #OdiaProgramming #RabiTalksCode #CodingInterview

In this video, you’ll learn the Stack Data Structure in the simplest way possible — explained in Odia. We’ll understand how Stack works, why it follows LIFO (Last In First Out), and how it’s used in real life — from browser back buttons to undo features. You’ll also see how to implement Stack in Java with practical examples and learn about push, pop, and peek operations along with time complexity. What You’ll Learn: • What is a Stack and how it works • LIFO concept explained with real-world analogy • Java implementation (push, pop, peek) • Common mistakes and interview tips • Time and space complexity analysis Why Watch This: If you’re preparing for coding interviews or learning DSA in Java, Stack is one of the most important fundamentals. By the end of this video, you’ll clearly understand the concept and be confident to solve related LeetCode and interview questions. If this video helps you: • Like 👍 and Share • Subscribe to “Rabi Talks Code” for more Odia DSA and Java tutorials • Comment your doubts or which data structure you want next #Stack #JavaDSA #OdiaProgramming #RabiTalksCode #CodingInterview

In this video, we’ll learn how to find the maximum number from an array in Java, explained in Odia with a clear step-by-step approach. We’ll discuss both the logic and code, starting from basic understanding of arrays to writing the Java program and analyzing how it works. What you’ll learn: • How to find the largest element in an array • Step-by-step dry run to understand the logic • Complete Java code walkthrough • Common mistakes and how to avoid them • Time and space complexity analysis This video is perfect for beginners learning Java and DSA in Odia, especially if you’re preparing for coding interviews or practicing on LeetCode. If this helps you, make sure to: • Like and Share with your friends • Subscribe to Rabi Talks Code for more Odia-based DSA content • Comment which question you want next! #JavaDSA #Array #FindMax #CodingInOdia #RabiTalksCode #LearnProgramming

In this video, we’ll understand what an Array is, how it actually works inside computer memory, and why array indexing starts from 0 — all explained clearly in Odia. We’ll also explore common array operations like Read, Insert, Search, and Delete, using simple real-life examples and code-level understanding. By the end of this session, you’ll be able to: • Understand how arrays are stored in continuous memory blocks • Learn why indexing starts from zero (with logic behind it) • Perform basic array operations (read, insert, search, delete) • Build the foundation for solving LeetCode and DSA problems This is part of our Odia DSA Series, where we simplify programming concepts and make them relatable for every student learning in their own language. If you found this helpful, make sure to: • Like and Share with your friends • Subscribe to Rabi Talks Code • Comment your doubts or the next DSA topic you want to learn! #Array #DSAinOdia #LearnCoding #JavaDSA #RabiTalksCode #ProgrammingOdia

In this video, I explain DSA (Data Structures & Algorithms) in a very simple way, in Odia. You’ll learn all types of data structures — linear, non-linear, hash / map, and more — with intuitive explanations, examples, and use cases. What You’ll Get From This Video: • Clear definition of DSA • Understanding of each DS type: linear, nonlinear, hash • Examples & intuitive analogies • Tradeoffs and when to choose each DS • Complexity (time & space) insights • Help you build a solid DS foundation Useful Links & Resources: GitHub / Code Repository: [your link] DSA / Java playlist: [link to your playlist] Related video: [next DS topic video] If this video helps you, please: 👍 Like & Share 📝 Comment your doubts or which DS you want next 🔔 Subscribe & hit the bell for more tutorials

In this video, you will learn how to solve the LeetCode Two Sum (Problem #1) using Java, with clear explanation in Odia. I walk you through both the brute force approach and the optimal HashMap solution, covering edge cases, time & space complexity, and tips to improve your coding interview skills. Check Out These Resources: Leetcode: https://leetcode.com/problems/two-sum/description/ What You Will Learn: • How Two Sum works and what the problem requires • Brute force Java implementation • Optimized Java solution using HashMap • Handling edge cases and constraints • Analyzing time complexity and space complexity • Tips for coding interview performance Why Watch This: Two Sum is one of the most asked problems in coding interviews and LeetCode. By learning it in Java + Odia, you’ll get a deeper grasp and be better prepared to solve similar problems in contests and interviews. If this video helps you, please: • Like (👍) and Share it • Subscribe to the channel and hit the bell icon 🔔 • Comment below your doubts, suggestions or which problem you want next #LeetCode #Java #OdiaTutorial