Tower of Hanoi - Recursion Visualization

14 Must-Know Data Structures for Coding Interviews: 1. Array 2. Queue 3. Deque 4. Matrix 5. Stack 6. Binary Tree 7. Linked List 8. Doubly Linked List 9. HashMap 10. Binary Search Tree (BST) 11. Heap (Priority Queue) 12. Trie 13. Graph 14. Union Find ♻️ Repost to help others in your network

7 Must-Know Big-O Complexities for Interviews: 1. 𝐎(1) - 𝐂𝐨𝐧𝐬𝐭𝐚𝐧𝐭 𝐭𝐢𝐦𝐞 - The runtime doesn't change regardless of the input size. - Example: Accessing an element in an array by its index. 2. 𝐎(𝐥𝐨𝐠 𝐧) - 𝐋𝐨𝐠𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞 - The runtime grows slowly as the input size increases. Typically seen in algorithms that divide the problem in half with each step. - Example: Binary search in a sorted array. 3. 𝐎(𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫 𝐭𝐢𝐦𝐞 - The runtime grows linearly with the input size. - Example: Finding an element in an array by iterating through each element. 4. 𝐎(𝐧 𝐥𝐨𝐠 𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞 - The runtime grows slightly faster than linear time. It involves a logarithmic number of operations for each element in the input. - Example: Sorting an array using quick sort or merge sort. 5. 𝐎(𝐧^2) - 𝐐𝐮𝐚𝐝𝐫𝐚𝐭𝐢𝐜 𝐭𝐢𝐦𝐞 - The runtime grows proportionally to the square of the input size. - Example: Bubble sort algorithm which compares and potentially swaps every pair of elements. 6. 𝐎(2^𝐧) - 𝐄𝐱𝐩𝐨𝐧𝐞𝐧𝐭𝐢𝐚𝐥 𝐭𝐢𝐦𝐞 - The runtime doubles with each addition to the input. These algorithms become impractical for larger input sizes. - Example: Generating all subsets of a set. 7. 𝐎(𝐧!) - 𝐅𝐚𝐜𝐭𝐨𝐫𝐢𝐚𝐥 𝐭𝐢𝐦𝐞 - Runtime is proportional to the factorial of the input size. - Example: Generating all permutations of a set. ♻️ Repost to help others learn this

Basic OOP Concepts Explained with Clear Examples: 1. 𝐄𝐧𝐜𝐚𝐩𝐬𝐮𝐥𝐚𝐭𝐢𝐨𝐧 Hide internal data behind public methods. - Example: A BankAccount class keeps balance and pin private. The only way to interact with it is through deposit() and getBalance(). 2. 𝐀𝐛𝐬𝐭𝐫𝐚𝐜𝐭𝐢𝐨𝐧 Expose a simple interface, hide the complexity behind it. - Example: An EmailService class gives you sendEmail(to, body). Internally, it handles SMTP connections, authentication, and retry logic. The caller doesn't need to know any of that. They just call one method and it works. 3. 𝐈𝐧𝐡𝐞𝐫𝐢𝐭𝐚𝐧𝐜𝐞 Let child classes reuse and override behavior from a parent class. - Example: An Animal class defines speak(). Dog extends it and returns "Woof!", Cat extends it and returns "Meow!". Shared logic lives in one place, and each subclass customizes what it needs. 4. 𝐏𝐨𝐥𝐲𝐦𝐨𝐫𝐩𝐡𝐢𝐬𝐦 Write code that works with multiple types through a common interface. - Example: Define a Shape interface with a draw() method. Now Circle, Rectangle, and Triangle each implement draw() their own way. A single drawShape(Shape s) method works with all of them. ♻️ Repost to help others learn this

𝐇𝐨𝐰 𝐭𝐨 𝐅𝐢𝐧𝐝 𝐚 𝐂𝐲𝐜𝐥𝐞 𝐢𝐧 𝐚 𝐋𝐢𝐧𝐤𝐞𝐝 𝐋𝐢𝐬𝐭 Use Floyd’s Cycle Detection Algorithm, also known as the slow and fast pointer technique. Start two pointers at the head: - slow moves one step at a time - fast moves two steps at a time If the linked list has no cycle, fast will eventually reach the end. If there is a cycle, fast will eventually catch up with slow inside the loop. Why does this work? Think of two runners on a circular track. If one runs faster than the other, they are guaranteed to meet eventually. Time Complexity: O(n) Space Complexity: O(1)

15 Must-Know Software Design Patterns: 1. Singleton 2. Factory Method 3. Builder 4. Adapter 5. Decorator 6. Facade 7. Proxy 8. Composite 9. Observer 10. Strategy 11. Command 12. Iterator 13. State 14. Template Method 15. Chain of Responsibility ♻️ Repost to help others in your network

7 Must-Know Big-O Complexities for Coding Interviews: 1. 𝐎(1) - 𝐂𝐨𝐧𝐬𝐭𝐚𝐧𝐭 𝐭𝐢𝐦𝐞 - The runtime doesn't change regardless of the input size. - Example: Accessing an element in an array by its index. 2. 𝐎(𝐥𝐨𝐠 𝐧) - 𝐋𝐨𝐠𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞 - The runtime grows slowly as the input size increases. Typically seen in algorithms that divide the problem in half with each step. - Example: Binary search in a sorted array. 3. 𝐎(𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫 𝐭𝐢𝐦𝐞 - The runtime grows linearly with the input size. - Example: Finding an element in an array by iterating through each element. 4. 𝐎(𝐧 𝐥𝐨𝐠 𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞 - The runtime grows slightly faster than linear time. It involves a logarithmic number of operations for each element in the input. - Example: Sorting an array using quick sort or merge sort. 5. 𝐎(𝐧^2) - 𝐐𝐮𝐚𝐝𝐫𝐚𝐭𝐢𝐜 𝐭𝐢𝐦𝐞 - The runtime grows proportionally to the square of the input size. - Example: Bubble sort algorithm which compares and potentially swaps every pair of elements. 6. 𝐎(2^𝐧) - 𝐄𝐱𝐩𝐨𝐧𝐞𝐧𝐭𝐢𝐚𝐥 𝐭𝐢𝐦𝐞 - The runtime doubles with each addition to the input. These algorithms become impractical for larger input sizes. - Example: Generating all subsets of a set. 7. 𝐎(𝐧!) - 𝐅𝐚𝐜𝐭𝐨𝐫𝐢𝐚𝐥 𝐭𝐢𝐦𝐞 - Runtime is proportional to the factorial of the input size. - Example: Generating all permutations of a set. ♻️ Repost to help others learn this

𝐇𝐨𝐰 𝐌𝐞𝐫𝐠𝐞 𝐒𝐨𝐫𝐭 𝐖𝐨𝐫𝐤𝐬 Merge Sort is a classic Divide & Conquer algorithm. Here’s the idea: - Divide → Split the array into two halves - Conquer → Recursively sort both halves - Combine → Merge the sorted halves into one sorted array The magic lies in the merge step, where two sorted arrays are combined efficiently in linear time. Time Complexity: O(n log n) (always) Quick example: [5, 2, 4, 1] → [5, 2] + [4, 1] → [2, 5] + [1, 4] → [1, 2, 4, 5] ♻️ Repost to help others in your network

How Bubble Sort Works

14 must-know Data Structures for coding interviews: 1. Array 2. Queue 3. Deque 4. Matrix 5. Stack 6. Binary Tree 7. Linked List 8. Doubly Linked List 9. HashMap 10. Binary Search Tree (BST) 11. Heap (Priority Queue) 12. Trie 13. Graph 14. Union Find ♻️ Repost to help others in your network

10 must-know Array patterns for coding interviews: 1. Two Pointers 2. Sliding Window 3. Prefix Sum 4. Kadane's Algorithm 5. Binary Search 6. Cyclic Sort 7. Merge Intervals 8. Monotonic Stack 9. Hash Map Lookup 10. Sorting + Greedy ♻️ Repost to help others in your network