rEst (@codeofalignment) profile picture

I am a story teller interested in the relationship between Religion, Science, and Technology.

Joined January 2023
Traversal (Display) in Linked List: Traversal means visiting each node of the linked list one by one and displaying its data. Unlike arrays, we can't jump to any index - we have to start from head and follow the next pointers until we hit NULL youtu.be/F_C8Qrh5jYc?si=5WnH…
11
A pointer head doesn't hold data, it holds an address (e.g., 100). When we call malloc(sizeof(struct Node)), we are literally asking the OS for memory. If it fails, we handle it gracefully. If it succeeds, we build: data = 10, next = NULL. youtu.be/WdUMpfHrthg?si=W0Y9…
1
1
7
Updating an element in an array simply means replacing the value stored at a particular position with a new value. For example, if we have [10, 20, 30, 40, 50] and want to change the value at index 2 from 30 to 35, we simply update it. youtube.com/watch?v=QRPvvQ2m…
1
1
12
In the last video we learned how to INSERT. Now let's learn the opposite, How to DELETE an element from an Array! Many beginners get confused about what happens to the array after deletion. In this video, I made it super simple with visuals and code. youtu.be/6SeK3sKLldE?si=cwFD…
5
DSA #12: INSERTION OF AN ELEMENT INTO AN ARRAY - EXPLAINED! In this video, we break down one of the most fundamental operations in Data Structures & Algorithms, How to Insert an element into an Array. youtu.be/ikdAUBHNFPg?si=owjM…
1
1
10
When you understand how a 2-D array is traversed, you're not just learning to print numbers, you are learning how the compiler, CPU, memory, and mathematics work together to transform logical instructions into physical execution. youtu.be/tCkRoLO6HYA?si=c3jz…
6
A 2D array is an array of one-dimensional arrays. Each row is itself a complete 1D array, and every element is stored in contiguous memory, allowing the compiler to translate logical indices into physical memory addresses. youtu.be/jgsL49vTh-w?si=1-3r…
11