![[GeeksForGeeks] Data Structures in Both C++ , Java](/store/1074/Add a heading (8).png)
[GeeksForGeeks] Data Structures in Both C++ , Java
in DSA Courses
Created by
GeeksforGeeks
About this course
Data Structures are an essential component of computer science and programming. They allow you to store, organize, and manipulate data efficiently. This course on Data Structures with Python is designed for both beginners and intermediate learners who want to build a strong foundation in data structures using Python.
In this course, you'll explore various data structures such as lists, stacks, queues, linked lists, trees, graphs, and hash tables. You will also learn how to implement them from scratch using Python, understand their underlying algorithms, and get hands-on experience with solving problems that require efficient data management.
What will you learn?
The fundamentals of data structures and their real-world applications.
How to implement basic and advanced data structures in Python.
Key operations like insertion, deletion, searching, and traversal in different data structures.
Algorithmic concepts such as time and space complexity (Big O Notation).
Advanced topics like balanced trees, graph algorithms, and hashing techniques.
Course Highlights:
Practical coding examples and problem-solving exercises.
In-depth explanations and visualizations to simplify complex concepts.
Real-life use cases to help you understand the significance of each data structure.
Emphasis on understanding the performance of data structures in different scenarios.
Whether you're preparing for technical interviews, building your own projects, or just improving your Python skills, this course provides a comprehensive learning experience to master data structures in Python.
Suggested by top companies
Top companies suggest this course to their employees and staff.
Comments (0)
12. Stack - 01
12 Parts
01. Stack Data Structure
-
02. Array Implementation of Stack in C++
-
03. Array Implementation of Stack in Java
-
04. Linked List Implementation of Stack in C++
-
05. Linked List Implementation of Stack in Java
-
06. Stack Application
-
07. Stack in C++ STL
-
08. Stack in Java Collections
-
09. Balanced Parenthesis
-
10. Two stacks in an array
-
11. K Stacks in an array
-
12. Stock span problem
-
12. Stack - 02
14 Parts
13. Previous Greater Element
-
14. Next Greater Element
-
15. Largest Rectangular Area in a Histogram (Part 1)
-
16. Largest Rectangular Area in a Histogram (Part 2)
-
17. Largest Rectangle with all 1's
-
18. Stack with getMin() in O(1)
-
19. Design a Stack with getMin() in O(1) Space
-
20. Infix, Prefix and Postfix Introduction
-
21. Infix to Postfix (Simple Solution)
-
22. Infix to Postfix (Efficient Solution)
-
23. Evaluation of Postfix
-
24. Infix to Prefix (Simple Solution)
-
25. Infix to Prefix (Efficient Solution)
-
26. Evaluation of Prefix
-
13. Queue
9 Parts
01. Queue Data Structure
-
02. Application of Queue Data structure
-
03. Implementation of Queue using Array
-
04. Implementation of Queue using Linked List
-
05. Queue in C++ STL
-
06. Queue in Java
-
07. Implementing stack using queue
-
08. Reversing a Queue
-
09. Generate numbers with given digits
-
14. Deque
8 Parts
01. Deque Data Structure
-
02. Array Implementation of Deque
-
03. Deque in C++ STL
-
04. Deque in Java
-
05. ArrayDeque in Java
-
06. Design a Data Structure with Min and Max operations
-
07. Maximums of all subarrays of size k
-
08. First Circular Tour
-
15. Tree - 01
15 Parts
01. Tree Data Structure
-
02. Application of Tree
-
03. Binary Tree
-
04. Tree Traversal
-
05. Implementation of Inorder Traversal
-
06. Implementation of Preorder Traversal
-
07. Implementation of Postorder Traversal
-
08. Height of Binary Tree
-
09. Print Nodes at K distance
-
10. Level Order Traversal
-
11. Level Order Traversal Line by Line (Part 1)
-
12. Level Order Traversal Line by Line (Part 2)
-
13. Size of Binary Tree
-
14. Maximum in Binary Tree
-
15. Print Left View of Binary Tree
-
15. Tree - 02
15 Parts
16. Children Sum Property
-
17. Check for Balanced Binary Tree
-
18. Maximum Width of Binary Tree
-
19. Convert Binary Tree to Doubly Linked List
-
20. Construct Binary Tree from Inorder and Preorder
-
21. Tree Traversal in Spiral Form
-
22. Diameter of a Binary Tree
-
23. LCA of Binary Tree (Part 1)
-
24. LCA of Binary Tree (Part 2)
-
25. Burn a Binary Tree from a Leaf
-
26. Count nodes in a Complete Binary Tree
-
27. Serialize and Deserialize a Binary Tree
-
28. Iterative Inorder Traversal
-
29. Iterative Preorder Traversal (Simple)
-
30. Iterative Preorder Traversal (Space Optimized)
-
16. BST - 01
16 Parts
01. Binary Search Tree(Background)
-
02. Binary Search Tree(Introduction)
-
03. Search in BST (Introduction)
-
04. Search in BST C++
-
05. Search in BST Java
-
06. Insert in BST-
-
07. Insert in BST C++
-
08. Insert in BST Java
-
09. Deletion in BST
-
10. BST deletion in C++
-
11. BST Deletion in Java
-
12. Floor in BST
-
13. Floor in BST in CPP
-
14. Floor in BST Java
-
15. Ceil in BST
-
16. Self Balancing BST
-
16. BST - 02
16 Parts
17. AVL Tree
-
18. Red Black Tree
-
19. Applications of BST
-
20. Set in C++ STL
-
21. Map in C++ STL
-
22. TreeSet In java
-
23. TreeMap in Java
-
24. Ceiling on left side in an array
-
25. Find Kth Smallest in BST
-
26. Check for BST
-
27. Fix BST with Two Nodes Swapped
-
28. Pair Sum with given BST
-
29. Vertical Sum in a Binary Tree
-
30. Vertical Traversal of Binary Tree
-
31. Top View of Binary Tree
-
32. Bottom View of Binary Tree
-
17. Heap - 01
9 Parts
01. Binary Heap Introduction
-
02. Binary Heap Implementation
-
03. Binary Heap Insert
-
04. Binary Heap (Heapify and Extract)
-
05. Binary Heap (Decrease Key, Delete and Build Heap)
-
06. Heap Sort
-
07. Priority Queue in C++
-
08. PriorityQueue in Java
-
09. Sort K-Sorted Array
-
17. Heap - 02
5 Parts
10. Buy Maximum Items with Given Sum
-
11. K Largest Elements
-
12. K Closest Elements
-
13. Merge K Sorted Arrays
-
14. Median of a Stream
-
18. Graph - 01
8 Parts
01. Introduction to Graph
-
02. Graph Representation (Adjacency Matrix)
-
03. Graph Representation (Adjacency List)
-
04. Adjacency List implementation in CPP
-
05. Adjacency List implementation in Java
-
06. Adjacency Matrix and List Comparison
-
07. Breadth First Search
-
08. Applications of BFS
-
18. Graph - 02
8 Parts
09. Depth First Search
-
10. Applications of DFS
-
11. Shortest Path in an Unweighted Graph
-
12. Detect Cycle in Undirected Graph
-
13. Detect Cycle in a Directed Graph (Part 1)
-
14. Topological Sorting (Kahn's BFS Based Algortihm)
-
15. Detect Cycle in a Directed Graph (Part 2)
-
16. Topological Sorting (DFS Based Algorithm)
-
18. Graph - 03
4 Parts
17. Shortest Path in DAG
-
18. Prim's Algorithm-Minimum Spanning Tree
-
19. Implementation of Prims Algorithm C++
-
20. Implementation of Prim's Algorithm Java
-
18. Graph - 04
5 Parts
21. Dijkstra's Shortest Path Algorithm
-
22. Implementation of Dijkstra's Algorithm C++
-
23. Implementation of Dijkstra's Algorithm Java
-
24. Kosaraju's Algorithm Part 1
-
25. Kosaraju's Algorithm Part 2
-
18. Graph - 05
5 Parts
26. Bellman Ford Shortest Path Algorithm
-
27. Articulation Point
-
28. Bridges in Graph
-
29. Tarjans Algorithm
-
30. Kruskal's Algorithm
-
19. Greedy
8 Parts
01. Introduction to Greedy Algorithms
-
02. Activity Selection Problem
-
03. Activity Selection Solution in C++
-
04. Activity Selection Solution in Java
-
05. Fractional Knapsack
-
06. Fractional Knapsack in C++
-
07. Fractional Knapsack in Java
-
08. Job Sequencing Problem-
-
20. Backtracking
4 Parts
01. Concepts of Backtracking
-
02. Rat In a Maze
-
03. N Queen Problem
-
04. Sudoku Problem
-
21. Dynamic programming part 1
13 Parts
01. Introduction to DP
-
02. Dynamic Programming Memoization
-
03. Dynamic Programming Tabulation
-
04. Longest Common Subsequence (Part 1)
-
05. Longest Common Subsequence (Part 2)
-
06. Variation of LCS
-
07. Coin Change Count Combinations
-
08. Edit Distance Problem
-
09. Edit Distance Problem DP solution
-
10. Longest Increasing Subsequence Problem
-
11. Longest Increasing Subsequence O(nlogn)
-
12. Variation of LIS (Part 1)
-
13. Variations of LIS (Part 2)
-
21. Dynamic programming part 2
8 Parts
14. Maximum Cuts
-
15. Minimum coins to make a value
-
16. Minimum Jumps to reach at end
-
17. 0-1 knapsack problem
-
18. 0-1 knapsack problem DP Solution
-
19. Optimal Strategy for a Game
-
20. Egg Dropping Puzzle - Part 1
-
21. Egg Dropping Puzzle - Part 2
-
21. Dynamic programming part 3
8 Parts
23. Maximum sum with no two consecutive
-
24. Subset Sum Problem (Recursive Solution)
-
25. Subset Sum Problem (DP Solution)
-
26. Matrix Chain Multiplication
-
27. Matrix Chain Multiplication (DP Solution)
-
28. Palindrome Partitioning
-
29. Allocate Minimum Pages (Naive Method)
-
30. Allocate Minimum Pages (DP Solution)
-
22. Trie
4 Parts
22. Trie
-
02. Trie (Representation, Search and Insert)-studyfever
-
03. Trie Delete
-
04. Count Distinct Rows in a Binary Matrix
-
23. Segment and Binary Indexed Trees
9 Parts
01. Segment Tree (Introduction)-studyfever
-
02. Constructing Segment Tree-studyfever
-
03. Range Query on Segment Tree-studyfever
-
04. Update Query on Segment Tree-studyfever
-
05. Binary Indexed Tree (Intoductiion)
-
06. Binary Indexed Tree (An Example Problem)
-
07. Binary Indxed Tree (Prefix Sum)
-
08. Binary Indexed Tree (Prefix Sum Implementaion)
-
09. Binary Indexed Tree (Update Operation)
-
24. Disjoint Set
5 Parts
01. Disjoint Set Introduction
-
02. Find and Union Operations on Disjoint Sets
-
03. Union by Rank
-
04. Path Compression
-
05. Kruskal's Algorithm
-
0
0 Reviews
.png)
