MSManikandan Sinmanikandan4411.hashnode.dev·1h ago · 7 min readLinkedList in Java1. What is LinkedList? LinkedList in Java is a class that implements the List and Deque interfaces. It stores elements as nodes, where each node contains the data and links to other nodes. It is usefu00
MSManikandan Sinmanikandan4411.hashnode.dev·2d ago · 5 min readArrayList in JavaArrayList is one of the most commonly used classes in the Java Collections Framework. It provides a resizable array that can grow or shrink dynamically. 1. What is ArrayList? Definition:ArrayList is 00
MSManikandan Sinmanikandan4411.hashnode.dev·4d ago · 7 min readJava Collection ComparisonsJava provides different collection types for storing and managing data. Understanding the differences between them is important for Java development, DSA, and interviews. This article covers the most 00
MSManikandan Sinmanikandan4411.hashnode.dev·5d ago · 5 min readSorting Collections in JavaSorting means arranging elements in a specific order, such as ascending or descending order. Java provides Collections, Comparable, and Comparator to sort collections easily. 1. Collections.sort() Def00
MSManikandan Sinmanikandan4411.hashnode.dev·Oct 1 · 6 min readJava CollectionsJava Collections Framework provides a set of interfaces, classes, and methods for storing and manipulating groups of objects. It makes it easier to store, search, sort, and process data in Java. 1. W00
ANAnand Nairindazzanova.hashnode.dev·Sep 30 · 3 min readA Deep-dive on std::vector in C++ (Part 1)I have been learning Data structures and Algorithms for online assessment rounds, primarily in C++. One day I randomly decided to take a turn towards understanding how C++ actually works under the hoo00
MSManikandan Sinmanikandan4411.hashnode.dev·Sep 29 · 6 min readJava Time Complexity and Space ComplexityTime Complexity and Space Complexity are important concepts in Data Structures and Algorithms (DSA). They help us understand how efficient a Java program or algorithm is. 1. What is Time Complexity? D00
MMMayank Mahajaninmayankdev.hashnode.dev·Sep 27 · 6 min readBinary Tree Traversals: Preorder, Inorder & Postorder ExplainedWhen working with a binary tree, the real question isn't just how to move through its nodes — it's in what order you choose to visit them. There are three fundamental depth-first search (DFS) traversa00
MMMayank Mahajaninmayankdev.hashnode.dev·Sep 25 · 5 min readLevel Order Traversal: Intuition, Queue, and BFSHow a queue helps us process binary trees level by level, from intuition to implementation. Level Order Traversal: Why We Walk Trees Breadth-First When you're asked to process a tree level by level — 00
POPablo Olléinimpoldev.hashnode.dev·Sep 25 · 3 min readYour code passes the examples. What should you test next?You solve a coding problem, run the examples, and everything passes. Before hitting Submit, ask yourself: which part of my solution have these examples actually tested? Let's use a small problem: Plus00
