Latest YouTube Videos

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