HomeDSA

DSA

Showing 1 - 10 of 21 results
  • March 22, 2026
πŸ“˜ Stack Using Array πŸš€ Introduction A Stack is a linear data structure that follows: πŸ‘‰ LIFO (Last In, First...
  • March 22, 2026
πŸš€ Introduction A Stack is a linear data structure that follows the principle: πŸ‘‰ LIFO (Last In, First Out) This...
  • March 22, 2026
πŸš€ Introduction A Doubly Linked List (DLL) is a type of linked list where each node contains: πŸ‘‰ This allows...
  • March 22, 2026
Circular Linked List πŸš€ Introduction A Circular Linked List is a type of linked list where: πŸ‘‰ The last node...
  • March 22, 2026
πŸš€ Introduction Deletion in a Linked List means removing a node from the list by adjusting pointers. πŸ‘‰ Unlike arrays,...
  • March 22, 2026
πŸš€ Introduction Insertion is a fundamental operation in a Linked List, where a new node is added at a specific...
  • March 22, 2026
Insertion in Linked List πŸš€ Introduction Insertion is one of the most important operations in a Linked List. πŸ‘‰ Unlike...
  • March 22, 2026
Introduction A Linked List is a fundamental data structure where elements (nodes) are connected using pointers. πŸ‘‰ Unlike arrays: Each...
  • March 22, 2026
Arrays (Advanced Techniques) πŸš€ Introduction If you already understand arrays, the next step is mastering advanced techniques that are heavily...
  • March 22, 2026
πŸš€ Introduction Kadane’s Algorithm is used to find the maximum sum of a contiguous subarray within a given array. πŸ‘‰...