Jyotiprakash Mishrablog.jyotiprakash.org·a day agoDSA: Problems on Recursion, Pointers, and Dynamic AllocationReverse a String: Write a recursive C program to reverse a given string. The program should take a string as input and return its reverse. Fibonacci Sequence: Write a recursive C program to find the n-th number in the Fibonacci sequence, utilizing m...Discuss·29 readsDSA

Aditya Vaasudev Badityavaasudevb.hashnode.dev·May 10, 2024Stacks 101: A Beginner's OverviewIntroduction Whether it's items in a store or books in a library, once they become more than handful, people naturally start tidying things up by stacking them. When man started programming data, stack was one of the first structures that he thought ...Discuss·1 likeStacks

Jyotiprakash Mishrablog.jyotiprakash.org·May 10, 2024Problems on ArraysMaximum Sum of Subarray: Problem: Write a C program to find the maximum sum of a subarray of size k. The user will input the size of the array and its elements, followed by the value of k. Example: Input: arr[] = {2, 1, 5, 1, 3, 2}, k = 3 Output:...Discuss·180 readsarrays

Jyotiprakash Mishrablog.jyotiprakash.org·May 9, 2024DSA: Linked ListsWhat are Linked Lists? Linked lists are a fundamental data structure in computer science used to store collections of elements. Unlike arrays, which store elements in contiguous memory locations, linked lists consist of nodes where each node contains...Discuss·54 readsdata structures

Muhire Josuéjosuedev.hashnode.dev·May 7, 2024Big O Notation Explained with ExamplesIntroduction Big O notation is a mathematical representation used to describe the performance or complexity of an algorithm. It provides a high-level understanding of how an algorithm's runtime or space requirements grow relative to the input size. B...Discuss·35 readsdata structure and algorithms

Jyotiprakash Mishrablog.jyotiprakash.org·May 4, 2024DSA: ArraysArrays are fundamental data structures in computer science, used to store elements of the same type in a contiguous block of memory. Each element in the array can be accessed using its index, which represents its position in the array. Here's an over...Discuss·278 readsDSA

Umang Srivastavaoutlierchronicles.hashnode.dev·May 2, 2024165. Compare Version NumbersProblem Statement Given two version numbers,version1andversion2, compare them. Version numbers consist of one or more revisions joined by a dot'.'. Each revision consists of digits and may contain leading zeros. Every revision contains at least one c...Discuss·10 likesLeetCode DailyPython

Jyotiprakash Mishrablog.jyotiprakash.org·May 3, 2024Why and What of DSA?Learning data structures and algorithms is fundamental for students, especially those studying computer science, for several reasons: Foundation of Programming: Data structures (like arrays, stacks, queues, linked lists, trees, and graphs) and algor...Discuss·157 readsdata structures

Anupam Shakyatheanupamshakya.hashnode.dev·Apr 24, 2024Free DSA Roadmap To Follow in 2024Greetings everyone, As we are moving forward in the tech industry, the hiring process for Tech roles is significantly getting tough nowadays. Then as a beginner or a intermediate we have to brush up the Data Structures and Algorithms understanding in...DiscussDeveloper

Back2Lobbyreid.hashnode.dev·Apr 23, 2024Linked Lists - Doubly Linked ListAlright, we covered singly linked list in the previous article, now it's time for a doubly linked list, which to be honest isn't that different much from a singly linked list. The only difference is we that each node contains a reference to the previ...DiscussDSADSA