Senior Software Engineer @Redhat | Teacher

🚀 Why Println?
Println is more than just a channel—it's a space where I share not only the What of technology but also the Why and How. I believe that understanding the reasoning behind coding concepts is crucial for true mastery.

🎓 What's in Store?
Get ready for free tutorials catered to beginners. Whether you're delving into Java, exploring microservices architecture, or conquering the realms of Docker, Kubernetes, and a plethora of technologies like Spring.

📚 Let's Dive In!
Join me on this educational adventure where we'll unravel the complexities of coding together. Whether you're a seasoned developer or a coding newbie, there's always room to expand your skills.

👍 Ready to Begin?
Hit that subscribe button, ring the bell icon, and let's embark on this coding journey with Println. Remember, coding is for everyone, and with Println, we're making it simpler, one line of code at a time.

Happy coding,
Soumyadip 🚀







Find the Frequency of an Array in Javascript | Day 34/50 of Javascript Challenge | Soumyadip
1:23
Find the Frequency of an Array in Javascript | Day 34/50 of Javascript Challenge | Soumyadip
Find Longest Word in an array (in one line) | Day 29/50 of Javascript Challenge | Soumyadip
1:14
Find Longest Word in an array (in one line) | Day 29/50 of Javascript Challenge | Soumyadip
#8.19 What is Double Way Threaded Binary Tree | Doubly Threaded Binary Tree | Tree | Data Structure
2:27
#8.19 What is Double Way Threaded Binary Tree | Doubly Threaded Binary Tree | Tree | Data Structure
#8.18 Introduction to Threaded Binary Tree | Single Threaded Binary Tree | Tree | Data Structure
3:30
#8.18 Introduction to Threaded Binary Tree | Single Threaded Binary Tree | Tree | Data Structure
#8.17 Deletion in a Binary Search Tree | Explanation | With Coding | Tree | Data Structure
16:44
#8.17 Deletion in a Binary Search Tree | Explanation | With Coding | Tree | Data Structure
#8.16 Find Maximum and Minimum Element from Binary Search Tree | With Coding | Tree | Data Structure
4:11
#8.16 Find Maximum and Minimum Element from Binary Search Tree | With Coding | Tree | Data Structure
#8.15 Binary Search Tree Traversal | In-Order | Pre-Order | Post-Order | Level-Order |Data Structure
6:50
#8.15 Binary Search Tree Traversal | In-Order | Pre-Order | Post-Order | Level-Order |Data Structure
#8.14 Search Operation in Binary Search Tree | Explanation | With Coding | Tree | Data Structure
7:11
#8.14 Search Operation in Binary Search Tree | Explanation | With Coding | Tree | Data Structure
#8.13 Insertion in a Binary Search Tree | Explanation | With Coding | Tree | Data Structure
15:44
#8.13 Insertion in a Binary Search Tree | Explanation | With Coding | Tree | Data Structure
#8.12 Introduction to Binary Search Tree | Time Complexity | BST vs Binary Tree| Tree|Data Structure
7:11
#8.12 Introduction to Binary Search Tree | Time Complexity | BST vs Binary Tree| Tree|Data Structure
#8.11 Post Order Traversal in a Binary Tree | Pre Order Traversal | Traversal | Tree |Data Structure
5:48
#8.11 Post Order Traversal in a Binary Tree | Pre Order Traversal | Traversal | Tree |Data Structure
#8.9 Pre Order Traversal in a Binary Tree | Pre Order Traversal | Traversal | Tree | Data Structure
6:02
#8.9 Pre Order Traversal in a Binary Tree | Pre Order Traversal | Traversal | Tree | Data Structure
#8.10 In Order Traversal in a Binary Tree | In Order Traversal | Traversal | Tree | Data Structure
6:37
#8.10 In Order Traversal in a Binary Tree | In Order Traversal | Traversal | Tree | Data Structure
#8.8 Types of Tree Traversal in Tree | Traversal | Tree | Data Structure
0:50
#8.8 Types of Tree Traversal in Tree | Traversal | Tree | Data Structure
#8.7 Implementations of Binary Tree using Linkedlist | With Coding | Tree | Data Structure
7:48
#8.7 Implementations of Binary Tree using Linkedlist | With Coding | Tree | Data Structure
#8.6 Implementations of Binary Tree using Array | Formula | Tree | Data Structure
4:23
#8.6 Implementations of Binary Tree using Array | Formula | Tree | Data Structure
#8.5 Types of Binary Tree | What is Perfect, Complete & Balanced Binary Tree | Tree | Data Structure
7:17
#8.5 Types of Binary Tree | What is Perfect, Complete & Balanced Binary Tree | Tree | Data Structure
#8.4 Introduction to Binary Tree | What is Binary Tree | Tree | Data Structure
3:34
#8.4 Introduction to Binary Tree | What is Binary Tree | Tree | Data Structure
#8.3 Tree Terminologies | Level, Height, Depth, Subtree, Branch, Forest | Part-2 | Data Structure
7:27
#8.3 Tree Terminologies | Level, Height, Depth, Subtree, Branch, Forest | Part-2 | Data Structure
#PRINTLN Get a Chance to win SWAGS | Writer the answer (3 Questions) in the Comment Section-Println
0:46
#PRINTLN Get a Chance to win SWAGS | Writer the answer (3 Questions) in the Comment Section-Println
#8.2 Tree Terminologies | Root, Edge, Child, Siblings, Degree, Parent, Leaf | Part-1 |Data Structure
8:17
#8.2 Tree Terminologies | Root, Edge, Child, Siblings, Degree, Parent, Leaf | Part-1 |Data Structure
#8.1 Introduction to Tree | What is Tree | Key Points of Tree | Tree | Data Structure
3:40
#8.1 Introduction to Tree | What is Tree | Key Points of Tree | Tree | Data Structure
#7.4 Queue using Linkedlist | Enqueue | Dequeue | Queue | Data Structure | Println
5:57
#7.4 Queue using Linkedlist | Enqueue | Dequeue | Queue | Data Structure | Println
#7.3 Dequeue in Queue | Delete element from Queue | Queue | Data Structure | Println
8:42
#7.3 Dequeue in Queue | Delete element from Queue | Queue | Data Structure | Println
#7.2 Enqueue in Queue | Insert Element into Queue | Queue | Data Structure | Println
8:56
#7.2 Enqueue in Queue | Insert Element into Queue | Queue | Data Structure | Println
#7.1 Introduction to Queue | Enqueue | Dequeue | Operations | Queue | Data Structure | Println
4:55
#7.1 Introduction to Queue | Enqueue | Dequeue | Operations | Queue | Data Structure | Println
#6.9 Infix to Postfix Conversion | Problem 2 | Steps | Explanation | Stack | Data Structure |Println
5:53
#6.9 Infix to Postfix Conversion | Problem 2 | Steps | Explanation | Stack | Data Structure |Println
#6.8 Infix to Postfix Conversion | Problem 1 | Steps | Explanation | Stack | Data Structure |Println
9:27
#6.8 Infix to Postfix Conversion | Problem 1 | Steps | Explanation | Stack | Data Structure |Println
#6.7 Introduction to Expressions | Infix | Prefix | Postfix | Stack | Data Structure | Println
2:06
#6.7 Introduction to Expressions | Infix | Prefix | Postfix | Stack | Data Structure | Println
#6.6 Two Stack | Push | Pop | Peek | with Coding | Stack | Data Structure | Println
16:37
#6.6 Two Stack | Push | Pop | Peek | with Coding | Stack | Data Structure | Println