Shaikh Farisfaristheprogrammer.hashnode.dev·4 hours agoThe Journey of a successful ProgrammerI am really excited to start my journey in blogging. I have learned web development and would love to contribute to open source. As of now, I will start learning DSA.DiscussWeb Development
Meetalistudayyy.hashnode.dev·18 hours agoWhy These Trees Won't Save Your Life, But Might Save Your Job!If you have already guessed that it's the topic Trees, then congratulations! Apparently, you and I share the same kind of humor! Data Structures and Algorithms (DSA) have a lot to offer, and one of the most important topics is "Trees". If only people...DiscussTrees
Fatima Jannatmahia.hashnode.dev·19 hours agoStack Explained: A Beginner's Guide to Data StructuresWhat is Stack? We can think of stack as a pile of vertically stacked objects. Insertion or removal of a stack follows the LIFO(Last-in First-Out) method. What's LIFO? Imagine you have a pile of books. Now if you want to take out one book from the pil...DiscussPython Data Structure and Algorithmstack
Vineeth Chivukulavineethchivukula.hashnode.dev·a day agoSolving Linked List CycleTo see the question, click here. Naive Approach The idea is to use a HashSet to keep track of the nodes we've visited. We know there is a cycle if we encounter a node we've already seen. // TC: O(n) // SC: O(n) import java.util.HashSet; class ListN...Discusslinked list
Fatima Jannatmahia.hashnode.dev·Jun 30, 2024Linked List Interview Challenges for Major Tech Companies: Amazon, Facebook, Apple, MicrosoftQuestion 1 : Remove Duplicates Write a function to remove duplicates from an unsorted linked list. Input 1 -> 2 -> 2 -> 3 -> 4 -> 4 -> 4 -> 5 Output 1 -> 2 -> 3 -> 4 -> 5 class Node: def __init__(self, value): self.value = value s...DiscussPython Data Structure and Algorithm#linkedlists
Tahzib Mahmud Rifatrifat05.hashnode.dev·Jun 30, 2024Cells with Odd Values in a Matrix(LeetCode-easy)INTRODUCTION We, have given two array one is main array matrix and other is indices[is a 2D array]. Each indices value consist two things one is row value and another is column value, indices[i] = [ri, ci]. And our task is to simply increment by 1 t...DiscussLeetCodeincrement
Fatima Jannatmahia.hashnode.dev·Jun 29, 2024What is a Circular Doubly Linked List?If you have went through my last blog, you certainly have clear idea on Doubly Linked List, right? Okay so, to make it more efficient, Circular Doubly List's tail node point to the head and head points to the tail. Means, there's no None present here...DiscussPython Data Structure and AlgorithmPython
Vineeth Chivukulavineethchivukula.hashnode.dev·Jun 29, 2024Solving Single NumberTo see the question, click here. Naive Approach To find the single element, we can first sort the array and then check for the single element. This approach works because each element appears twice except for one, and when the array is sorted, these ...Discusssingle number
Vineeth Chivukulavineethchivukula.hashnode.dev·Jun 29, 2024Understanding Depth-First SearchDepth-First Search (DFS) is a traversal technique used in graph data structures that explores each branch as far as possible before backtracking. This technique is often implemented using a stack data structure or through recursion. Process Initial...DiscussDFS
Vineeth Chivukulavineethchivukula.hashnode.dev·Jun 29, 2024Understanding Breadth-First SearchBreadth-First Search (BFS) is a traversal technique used in graph data structures that explores all the vertices at the present depth level before moving on to vertices at the next depth level. This technique is often implemented using a queue data s...DiscussBFS
