Shams Nahidblog.shams-nahid.com·Sep 10, 2024Fibonacci Number: From recursion to memoization and ultimately space-optimized solutionLet’s evaluate the Classic Dynamic Programming problem, Fibonacci Number in a crispy way. We will start solving the problem from a recursive solution and later step by step we will use memoization and space optimization. The Fibonacci Number or Fibon...DiscussNode.js & JavaScriptJavaScript

froilanfroilanimnida.hashnode.dev·Aug 24, 2024ACTIVITY #4 Git Fundamentals Documentation on HashnodeStep 1: Check Git Version: Step 2: Configure Git: Note: I am already using git email alias so I wont set it up Step 3: Git init: Step 4: Add Files to the Repository: Step 5: Check the Status: Step 6: Commit Changes: Step 7: View Commit History...Discuss·55 readsGitHub

Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 19, 2024Binary Search TreeIntroduction A Binary Search Tree (BST) is a data structure that maintains sorted data in a way that allows for efficient insertion, deletion, and lookup operations. Each node in a BST has the following properties: Node: Contains a value (data). Le...DiscussData Structures and Algorithms in JavaScriptDSA

SAI GOUTHAMgouthamcodes.hashnode.dev·Aug 16, 2024Understanding How Big O Notation is Calculated: A Detailed Guide💡 DSA-1.2 Welcome to the second post of our series on data structures and algorithms. In the previous post, we introduced the concept of Big O Notation and why it's crucial for writing efficient, scalable code. In this post, we’ll dive deeper into...DiscussData Structures and Algorithms#BigO #AlgorithmEfficiency #TimeComplexity #AsymptoticAnalysis #DataStructures #CodingInterviews #PerformanceAnalysis #ComputerScience #ProgrammingLanguages #SoftwareEngineering #EfficientAlgorithms #ComplexityTheory #AlgorithmDesign

Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 13, 2024Linear SearchLinear search is a simple searching algorithm used to find an element in a list or an array. It works by sequentially checking each element of the list until it finds the target element or reaches the end of the list. Code function linearSearch(arr, ...DiscussData Structures and Algorithms in JavaScriptDSA

Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 12, 2024Quick SortIntroduction Quick sort follows the divide-and-conquer approach, selecting a pivot element and partitioning the array into two subarrays: elements less than the pivot and elements greater than the pivot. It recursively sorts the subarrays and combi...DiscussData Structures and Algorithms in JavaScriptDSA

Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 12, 2024Merge SortMerge sort divides the array into two halves, recursively sorts each half, and then merges them back together in sorted order. It follows the divide-and-conquer approach, achieving a time complexity of O(nlogn). Code function mergeSort(arr) { co...DiscussData Structures and Algorithms in JavaScriptDSA

Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 12, 2024Selection SortIntroduction Initialization: The function selectionSort accepts an array arr as its argument. The variable n stores the length of the array. Outer Loop: The outer loop iterates through each element in the array, treating each element as the st...DiscussData Structures and Algorithms in JavaScriptDSA

Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 12, 2024Data Structures and AlgorithmsData Structures Stack Queue Singly Linked List Doubly Linked List Hash Table Heap Priority Queue Tree Binary Search Tree AVL Tree Red Black Tree Algorithms Array Cartesian Product Sorting Bubble Sort Insertion Sort Counting Sort Selection ...Discuss·45 readsData Structures and Algorithms in JavaScriptDSA

Sushil Kumar Mishrasushilsblog.hashnode.dev·Aug 11, 2024Step-by-Step Guide to Array-Based Linked List ImplementationIntroduction to Linked Lists Linked lists are a fundamental data structure in computer science, allowing for efficient insertion and deletion of elements. Unlike arrays, linked lists do not require a contiguous block of memory, making them more flexi...Discuss·2 likesarray