KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#developer-tools #typescript #dsh #dsh-plugin #ai-agent #codex #ai-agents #deepseek-harness #claude-code #cli #react #mcp

dsa-cpp-apna-college

★ 6 Open GitHub ↗

This is the code repository for C++ DSA course by Apna College on Youtube.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Data Structures and Algorithms in C++ by Apna College #

This is the code repository of C++ DSA course by Apna College on Youtube.

## Data Structures included: ##

1.Arrays

&ensp;&ensp;<a href="/8_1_introduction_to_arrays.cpp" target="_blank">8.1 Introduction to Arrays in C++</a> | <a href="https://youtu.be/PyTK_g1l8V8" target="_blank">YouTube</a> | <a href="https://nbviewer.org/github/purushottamnawale/apnacollege/blob/main/8_1_introduction_to_arrays_in_cpp.pdf" target="_blank">PDF</a>

&ensp;&ensp;<a href="/8_1_input_to_array.cpp" target="_blank">8.1 Input to Array</a> | <a href="https://youtu.be/PyTK_g1l8V8?t=355" target="_blank">YouTube</a>

&ensp;&ensp;<a href="/8_1_max_min_in_array.cpp" target="_blank">8.1 Maximum and Minimum in Array</a> | <a href="https://youtu.be/PyTK_g1l8V8?t=468" target="_blank">YouTube</a>

&ensp;&ensp;<a href="/8_4_array_challenges_max_till_i.cpp" target="_blank">8.4 Maximum till i</a> | <a href="https://youtu.be/eJcBH0xvG98" target="_blank">YouTube</a> | <a href="https://nbviewer.org/github/purushottamnawale/apnacollege/blob/main/8_4_array_challenges_max_till_i.pdf" target="_blank">PDF</a>

&ensp;&ensp;<a href="https://nbviewer.org/github/purushottamnawale/apnacollege/blob/main/8_4_array_challenges_subarray_vs_subsequence.pdf" target="_blank">8.4 Subarray vs Subsequence PDF</a>

&ensp;&ensp;<a href="/8_4_array_challenges_sum_of_all_subarrays.cpp" target="_blank">8.4 Sum of all Subarrays</a> | <a href="https://youtu.be/eJcBH0xvG98?t=483" target="_blank">YouTube</a> | <a href="https://nbviewer.org/github/purushottamnawale/apnacollege/blob/main/8_4_array_challenges_sum_of_all_subarrays.pdf" target="_blank">PDF</a>

&ensp;&ensp;<a href="/8_4_array_challenges_longest_arithmetic_subarray.cpp" target="_blank">8.4 Longest Arithmetic Subarray</a> | <a href="https://youtu.be/eJcBH0xvG98?t=844" target="_blank">YouTube</a> | <a href="https://nbviewer.org/github/purushottamnawale/apnacollege/blob/main/8_4_array_challenges_subarray_vs_subsequence.pdf" target="_blank">PDF</a>

&ensp;&ensp;<a href="/8_4_array_challenges_record_breaker.cpp" target="_blank">8.4 Record Breaker</a> | <a href="https://youtu.be/eJcBH0xvG98?t=1531" target="_blank">YouTube</a> | <a href="https://nbviewer.org/github/purushottamnawale/apnacollege/blob/main/8_4_array_challenges_record_breaker.pdf" target="_blank">PDF</a>

2.Stacks 
3.Queues 
4.Linked lists 
5.Recursion 
6.Trees 
7.Binary search trees 
8.Binary heaps 
9.Graphs

## Algorithms included: ##

1.Searching 
&ensp;&ensp;<a href="/8_2_linear_search.cpp" target="_blank">8.2 Linear Search</a> | <a href="https://youtu.be/13ocRMSJy5M" target="_blank">YouTube</a> 
&ensp;&ensp;<a href="/8_2_binary_search.cpp" target="_blank">8.2 Binary Search</a> | <a href="https://youtu.be/13ocRMSJy5M?t=299" target="_blank">YouTube</a> 
2.Sorting 
&ensp;&ensp;<a href="/8_3_1_selection_sort.cpp" target="_blank">8.3.1 Selection Sort</a> | <a href="https://youtu.be/dQa4A2Z0_Ro" target="_blank">YouTube</a> | <a href="/8_3_1_selection_sort_correction.cpp" target="_blank">Correction</a> 
&ensp;&ensp;<a href="/8_3_2_bubble_sort.cpp" target="_blank">8.3.1 Bubble Sort</a> | <a href="https://youtu.be/xcPFUCh0jT0" target="_blank">YouTube</a> 
&ensp;&ensp;<a href="/8_3_3_insertion_sort.cpp" target="_blank">8.3.1 Insertion Sort</a> | <a href="https://youtu.be/3GC83dh4cf0" target="_blank">YouTube</a> 
3.Hashing 
4.Asymptotic worst-case time and space complexity 
5.Algorithm design techniques: 
&ensp;&ensp;1.Greedy 
&ensp;&ensp;2.Dynamic programming 
&ensp;&ensp;3.Divide-and-conquer 
6.Graph search 
7.Minimum spanning trees 
8.Shortest paths

dsa-cpp-apna-college

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README