LoveBabbar-DSA

KO | EN

gitlite — search

#javascript #go #golang #rust #deep-learning #linux #macos #nodejs #windows #awesome #kubernetes #awesome-list #pytorch #ios

(★ 190)

Lecture wise code files of Love Babbar DSA course in C++

LoveBabbar-DSA 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Love Babbar - DSA with C++
## Lecture wise code files of Love Babbar DSA course in C++

<br>

- **Lecture - 001** : <ins>Intro to programming & flowcharts</ins> - _22-12-2022 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-001)
- **Lecture - 002** : <ins>Write your first program in C++</ins> - _23-12-2022 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-002)
- **Lecture - 003** : <ins>If-else, while loop & lots of pattern</ins> - _28-12-2022 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-003)
- **Lecture - 004** : <ins>Solving pattern questions</ins> - _29-12-2022 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-004)
- **Lecture - 005** : <ins>Bitwise operators, for loops, operator precedence & variable scoping</ins> - _30-12-2022 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-005)
- **Lecture - 006** : <ins>Binary & decimal number system</ins> - _02-01-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-006)
- **Lecture - 007** : <ins>Leetcode problem solving session</ins> - _03-01-2023 (Tue)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-007)
- **Lecture - 008** : <ins>Switch statement & functions</ins> - _04-01-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-008)
- **Lecture - 009** : <ins>Introduction to arrays in C++</ins> - _05-01-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-009)
- **Lecture - 010** : <ins>Solving leetcode/codestudio questions (arrays)</ins> - _06-01-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-010)
- **Lecture - 011** : <ins>Time & space complexity</ins> - _09-01-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-011)
- **Lecture - 012** : <ins>Binary search</ins> - _09-01-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-012)
- **Lecture - 013** : <ins>Binary search interview questions (part-1)</ins> - _10-01-2023 (Tue)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-013)
- **Lecture - 014** : <ins>Binary search interview questions (part-2)</ins> - _11-01-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-014)
- **Lecture - 015** : <ins>Book allocation & aggressive cow problem</ins> - _12-01-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-015)
- **Lecture - 016** : <ins>Selection sort</ins> - _14-01-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-016)
- **Lecture - 017** : <ins>Bubble sort</ins> - _16-01-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-017)
- **Lecture - 018** : <ins>Insertion sort</ins> - _17-01-2023 (Tue)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-018)
- **Lecture - 019** : <ins>C++ STL</ins> - _20-01-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-019)
- **Lecture - 020** : <ins>Solving leetcode/codestudio questions (arrays)</ins> - _21-01-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-020)
- **Lecture - 021** : <ins>Solving leetcode/codestudio questions (arrays)</ins> - _23-01-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-021)
- **Lecture - 022** : <ins>All about char arrays, strings & solving leetcode questions</ins> - _25-01-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-022)
- **Lecture - 023** : <ins>Introduction to 2D arrays in C++</ins> - _21-02-2023 (Tue)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-023)
- **Lecture - 024** : <ins>Basic math for DSA</ins> - _22-02-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-024)
- **Lecture - 025** : <ins>Pointers in C++ (part-1)</ins> - _23-02-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-025)
- **Lecture - 026** : <ins>Pointers in C++ (part-2)</ins> - _24-02-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-026)
- **Lecture - 027** : <ins>Double pointers in C++</ins> - _25-02-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-026)
- **Lecture - 028** : <ins>Reference variables, static vs dynamic memory</ins> - _26-02-2023 (Sun)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-026)
- **Lecture - 029** : <ins>Dynamic memory allocation</ins> - _26-02-2023 (Sun)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-029)
- **Lecture - 030** : <ins>Macros, global variables, inline functions & default arguments</ins> - _27-02-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-030)
- **Lecture - 031** : <ins>Learning recursion the best way</ins> - _27-02-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-031)
- **Lecture - 032** : <ins>Understanding recursion</ins> - _28-02-2023 (Tue)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-032)
- **Lecture - 033** : <ins>Recursion & binary search</ins> - _01-03-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-033)
- **Lecture - 034** : <ins>Recursion with strings</ins> - _02-03-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-034)
- **Lecture - 035** : <ins>Merge sort using recursion</ins> - _03-03-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-035)
- **Lecture - 036** : <ins>Quick sort using recursion</ins> - _04-03-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-036)
- **Lecture - 037** : <ins>Recursion: subsets/subsequences of string</ins> - _05-03-2023 (Sun)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-037)
- **Lecture - 038** : <ins>Phone keypad problem</ins> - _06-03-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-038)
- **Lecture - 039** : <ins>Permutation of a string</ins> - _07-03-2023 (Tue)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-039)
- **Lecture - 040** : <ins>Rat in a maze problem</ins> - _09-03-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-040)
- **Lecture - 041** : <ins>Time & space complexity of recursive algorithm</ins> - _10-03-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-041)
- **Lecture - 042** : <ins>OOPs concepts in C++</ins> - _13-03-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-042)
- **Lecture - 043** : <ins>A pillars of OOPs concept: inheritance, polymorphism, encapsulation & abstraction</ins> - _16-03-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-043)
- **Lecture - 044** : <ins>Linked list & its types - singly, doubly, circular</ins> - _22-03-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-044)
- **Lecture - 045** : <ins>Linked list questions: reverse LL and find middle of LL</ins> - _23-03-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-045)
- **Lecture - 046** : <ins>Linked list questions: reverse LL in 'k group' && check LL is circular or not</ins> - _25-03-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-046)
- **Lecture - 047** : <ins>Detect & remove loop in linked list</ins> - _26-03-2023 (Sun)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-047)
- **Lecture - 048** : <ins>Remove duplicates from a sorted/unsorted linked list</ins>
- **Lecture - 049** : <ins>Merge 2 sorted linked list & sort 0s, 1s, 2s in linked list</ins>
- **Lecture - 050** : <ins>Check palindrome in linked list</ins>
- **Lecture - 051** : <ins>Add 2 Numbers represented by linked lists</ins>
- **Lecture - 052** : <ins>Clone a linked list with random pointers</ins>
- **Lecture - 053** : <ins>Merge sort in linked list</ins>
- **Lecture - 054** : <ins>Introduction to stacks</ins>
- **Lecture - 055** : <ins>Stack interview questions</ins>
- **Lecture - 056** : <ins>Largest rectangular area in histogram</ins> - _12-04-2023 (Wed)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-056)
- **Lecture - 057** : <ins>Stack - celebrity problem & max rectangle in binary matrix with all 1's</ins> - _13-04-2023 (Thu)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-057)
- **Lecture - 058** : <ins>'N' stacks in an array</ins> - _14-04-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-058)
- **Lecture - 059** : <ins>Design special stack problem</ins> - _15-04-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-059)
- **Lecture - 060** : <ins>Queues in C++</ins> - _17-04-2023 (Mon)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-060)
- **Lecture - 061** : <ins>Queue FAANG interview questions</ins>
- **Lecture - 062** : <ins>Binary trees & its representations</ins> - _21-04-2023 (Fri)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-062)
- **Lecture - 063** : <ins>Binary tree FAANG interview questions (part-1)</ins> - _22-04-2023 (Sat)_ :white_check_mark: [**(View Code)**](https://github.com/geekblower/LoveBabbar-DSA/tree/main/Lecture-063)
- **Lecture - 064** : <ins>Binary tree FAANG interview questions (part-2)</ins>
- **Lecture - 065** : <ins>Binary tree FAANG interview questions (part-3)</ins>

- **Lecture - 066** : <ins>Construct a binary tree from inorder, preorder & postorder traversal</ins>
- **Lecture - 067** : <ins>Minimum time to burn the entire binary tree</ins>
- **Lecture - 068** : <ins>Morris traversal: Flatten a binary tree to linked list</ins>
- **Lecture - 069** : <ins>Binary search tree & its implementation</ins>
- **Lecture - 070** : <ins>Binary search tree FAANG interview questions (part-1)</ins>
- **Lecture - 071** : <ins>Binary search tree FAANG interview questions (part-2)</ins>
- **Lecture - 072** : <ins>Merge 2 binary search trees</ins>
- **Lecture - 073** : <ins>Largest BST in a binary tree</ins>
- **Lecture - 074** : <ins>Heaps in C++</ins>
- **Lecture - 075** : <ins>Heaps interview questions (part-1)</ins>
- **Lecture - 076** : <ins>Heaps interview questions (part-2)</ins>
- **Lecture - 077** : <ins>Heaps interview questions (part-3)</ins>
- **Lecture - 078** : <ins>Hashmaps in C++</ins>
- **Lecture - 079** : <ins>Trie & its implementation</ins>
- **Lecture - 080** : <ins>Longest common prefix problem</ins>
- **Lecture - 081** : <ins>Implement a phone directory using trie</ins>
- **Lecture - 082** : <ins>Rat in maze problem</ins>
- **Lecture - 083** : <ins>N-Queen problem</ins>
- **Lecture - 084** : <ins>Sudoku solver problem</ins>
- **Lecture - 085** : <ins>Introduction to graphs</ins>
- **Lecture - 086** : <ins>BFS traversal in graphs</ins>
- **Lecture - 087** : <ins>DFS traversal in graphs</ins>
- **Lecture - 088** : <ins>Cycle detection in undirected graphs</ins>
- **Lecture - 089** : <ins>Cycle detection in directed graphs</ins>
- **Lecture - 090** : <ins>Topological sort (using DFS)</ins>
- **Lecture - 091** : <ins>Topological sort (using kahn's algorithm)</ins>
- **Lecture - 092** : <ins>Cycle detection in directed graphs (using BFS)</ins>
- **Lecture - 093** : <ins>Shortest path in undirected graphs</ins>
- **Lecture - 094** : <ins>Shortest path in directed acyclic graphs</ins>
- **Lecture - 095** : <ins>Dijkstra's algorithm</ins>
- **Lecture - 096** : <ins>Minimum spanning tree</ins>
- **Lecture - 097** : <ins>Kruskal's algorithm, Disjoint set & Union by rank & path compression</ins>
- **Lecture - 098** : <ins>Bridges in a graph</ins>
- **Lecture - 099** : <ins>Articulation points in graphs</ins>
- **Lecture - 100** : <ins>Kosaraju's algorithm for strongly connected components</ins>
- **Lecture - 101** : <ins>Bellman ford algorithm</ins>
- **Lecture - 102** : <ins>Introduction to dynamic programming</ins>
- **Lecture - 103** : <ins>Minimum cost climbing stairs</ins>
- **Lecture - 104** : <ins>Minimum number of coins</ins>
- **Lecture - 105** : <ins>Maximum sum of non-adjacent elements</ins>
- **Lecture - 106** : <ins>House robbery problem</ins>
- **Lecture - 107** : <ins>Cut rod into segments of X, Y, Z</ins>
- **Lecture - 108** : <ins>Count derangements</ins>
- **Lecture - 109** : <ins>Painting fence algorithm</ins>
- **Lecture - 110** : <ins>0/1 knapsack problem - 2D DP concept</ins>
- **Lecture - 111** : <ins>Combination sum IV problem</ins>
- **Lecture - 112** : <ins>Perfect squares problem</ins>
- **Lecture - 113** : <ins>Minimum cost for tickets (part-1)</ins>
- **Lecture - 114** : <ins>Minimum cost for tickets (part-2)</ins>
- **Lecture - 115** : <ins>Largest square area in matrix</ins>
- **Lecture - 116** : <ins>Min score triangulation problem</ins>
- **Lecture - 117** : <ins>Minimum sideways jump leetcode</ins>
- **Lecture - 118** : <ins>Reducing dishes leetcode</ins>
- **Lecture - 119** : <ins>Longest increasing subsequence & Russian Doll leetcode</ins>
- **Lecture - 120** : <ins>Maximum height by stacking cuboid</ins>
- **Lecture - 121** : <ins>Pizza with 3n slices</ins>
- **Lecture - 122** : <ins>Number of dice rolls with target sum</ins>
- **Lecture - 123** : <ins>Partition equal subset sum</ins>
- **Lecture - 124** : <ins>Minimum swaps to make subsequences increasing</ins>
- **Lecture - 125** : <ins>Longest arithmetic subsequence</ins>
- **Lecture - 126** : <ins>Longest AP with given difference 'd'</ins>
- **Lecture - 127** : <ins>Unique binary search trees & catalan numbers</ins>
- **Lecture - 128** : <ins>Guess number higher or lower</ins>
- **Lecture - 129** : <ins>Minimum cost tree from leaf values</ins>
- **Lecture - 130** : <ins>Buy and sell stock (part-1)</ins>
- **Lecture - 131** : <ins>Buy and sell stock (part-2)</ins>
- **Lecture - 132** : <ins>Buy and sell stock (part-3)</ins>
- **Lecture - 133** : <ins>Buy and sell stock (part-4)</ins>
- **Lecture - 134** : <ins>Buy and sell stock (part-5)</ins>
- **Lecture - 135** : <ins>Longest common subsequence</ins>
- **Lecture - 136** : <ins>Longest palindromic subsequence</ins>
- **Lecture - 137** : <ins>Edit distance</ins>
- **Lecture - 138** : <ins>Maximum rectangle with all 1's</ins>
- **Lecture - 139** : <ins>Wildcard pattern matching</ins>
- **Lecture - 140** : <ins>Greedy algorithms</ins>

## Contributors :
<a href="https://github.com/geekblower/LoveBabbar-DSA/graphs/contributors">
  <img src="https://contrib.rocks/image?repo=geekblower/LoveBabbar-DSA" />
</a>

LoveBabbar-DSA

LoveBabbar-DSA 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

LoveBabbar-DSA

LoveBabbar-DSA 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README