DSA to Development A Complete Guide
- Offered byGeeksforGeeks
DSA to Development A Complete Guide at GeeksforGeeks Overview
Duration | 150 hours |
Mode of learning | Online |
Official Website | Go to Website |
Credential | Certificate |
DSA to Development A Complete Guide at GeeksforGeeks Highlights
- Earn a certificate after completion of the course
- Projects for real world scenarios
- Resume Building
- 1:1 Mock Interviews
DSA to Development A Complete Guide at GeeksforGeeks Course details
This course has been carefully crafted to guide you through a transformative process, starting from a solid understanding of Data Structures and Algorithms (DSA)
and leading you towards becoming a skilled developer
Regardless of whether your goal is to excel as a full-stack developer or specialize in a particular technology stack, this course equips you with the fundamental tools necessary for your coding journey, starting from the basics of programming and progressing towards application development
DSA to Development A Complete Guide at GeeksforGeeks Curriculum
Analysis of Algorithm, Mathematics & Bit Manipulation
Asymptotic Analysis
Time and Space Complexity
Masters Theorem
Bitwise Operators (Bitwise AND, Bitwise OR, Bitwise XOR, Left Shift, Right Shift, etc )
Problems: GCD and LCM, Iterative Power, Generate Power Set, etc
Arrays
Arrays - Introduction and Advantages
Types of Arrays
Operations of Arrays - Searching, Insertion, and Deletion
Sliding Window Technique
Problems: Largest Element in an Array, Leaders in an Array Problem, Maximum Subarray Sum, etc
Linked List
Introduction to Linked List
Traversing a Linked List
Insertion and Deletion of Node in Linked List
Doubly Linked List and Circular Linked List
Problems: Middle of Linked List, Deleting a Node without accessing Head pointer of Linked List, etc
Stack
Stack - Introduction and Applications
Stack Operations (e.g. push, pop, etc)
Array Implementation of Stack
Linked List Implementation of Stack
Problems: Balanced Parenthesis, Next Greater Element, etc
Queue and Deque
Queue - Introduction and Application
Implementation of Queue using Array
Implementation of Queue using Linked List
Deque - Introduction and Application
Problems: Generate Numbers with Given Digits, First Circular Tour, etc
Searching
Linear Search
Binary Search - Iterative and Recursive Approach
Analysis of Binary Search
Two Pointer Approach
Problems: Index of the first Occurrence in SortedArray, Count 1s in a Sorted
Binary Array, Square root of a number, etc
Recursion and Backtracking
Introduction to Recursion
Writing Base Cases in Recursion
Tail Recursion
Introduction to Backtracking
Problems: Print 1 to N Using Recursion, Rope Cutting Problem, Rat in a Maze, etc
Sorting
Overview of the Sorting Algorithm
Sorting Algorithms e.g. Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort with Analysis
Stability of Sorting Algorithms
Problems: Minimum Difference in an Array, Chocolate Distribution Problem, etc