gitextract_md51_btr/

├── 35_hacker_two_strings.cpp
├── 36_codechef_Encoding_message.cpp
├── 37_codechef_spell_bob.cpp
├── 38_codechef_fits_square_in_triangle.cpp
├── 39_codechef_chef_and_Eid.cpp
├── 40_codechef_chef_judges_competition.cpp
├── 41_codechef_chef_and_glove.cpp
├── 42_codechef_the_great_run.cpp
├── 43_codechef_attendance.cpp
├── 44_codechef_making_a_meal.cpp
├── 45_codechef_uncle_johny.cpp
├── 46_drink_codeforce.cpp
├── 47_candles_codeforces.cpp
├── 49_two_buttons_codeforces.cpp
├── 50_vanya_and_books_codeforces.cpp
├── 51_eleven_codeforces.cpp
├── 52_codechef_flatland.cpp
├── 53_codeforces_MUH_and_sticks.cpp
├── 54_print_subset_of_size_k_of_array.cpp
├── 55_codechef_Easy_Fibonacci.cpp
├── 56_codechef_Chef_and_Interesting_Subsequences.cpp
├── 57_codechef_A-books.cpp
├── 58_codechef_phone_prices.cpp
├── 59_codechef_operations_on_a_matrix.cpp
├── 60_Adding_one_to_the_numbers.cpp
├── Chef and Price Control.cpp
├── Data Structures/
│   ├── Add a node at the Middle of linked list.cpp
│   ├── Add a node at the end of linked list.cpp
│   ├── Add a node at the front of linked list.cpp
│   ├── Array_in_data_structures.cpp
│   ├── Circular Linked List data_structure.cpp
│   ├── Delete a node of a linked list.cpp
│   ├── Doubly Linked list.cpp
│   ├── Find the middle of a given linked list.cpp
│   ├── Insert Node at the End of Doubly Linked List.cpp
│   ├── Insert Node in Middle of Doubly Linkedlist.cpp
│   ├── LinkedList_Code_Practice.cpp
│   ├── Vectors_in_STL_data_structure.cpp
│   ├── main.cpp
│   └── structure_in_c++.cpp
├── Kadane's_algorithm.cpp
├── Kadane's_algorithm.pptx
├── Lecture - 15.cpp
├── Lecture - 16.cpp
├── Lecture - 17.cpp
├── Lecture - 18.cpp
├── Lecture - 19.cpp
├── Lecture - 20.cpp
├── Lecture - 21.cpp
├── Lecture - 22.cpp
├── Lecture - 24.cpp
├── Lecture - 25.cpp
├── Lecture - 26.cpp
├── Lecture - 27.cpp
├── Lecture - 31.cpp
├── Lecture - 32.cpp
├── Lecture - 33.cpp
├── Lecture - 34.cpp
├── Leetcode/
│   ├── Add Digits.cpp
│   ├── Add Two Numbers Leetcode Solutions in Linkedlist.cpp
│   ├── Binary Search leetcode Solution.cpp
│   ├── Boolean Matrix.cpp
│   ├── Count the Number of Consistent Strings.cpp
│   ├── Graph/
│   │   ├── All Paths From Source to Target.cpp
│   │   ├── Course Schedule.cpp
│   │   ├── Detect cycle in a directed graph.cpp
│   │   ├── Find Eventual Safe States.cpp
│   │   ├── Find if Path Exists in Graph.cpp
│   │   ├── Find the Town Judge.cpp
│   │   ├── Flood Fill.cpp
│   │   ├── Keys and Rooms.cpp
│   │   ├── Max Area of Island.cpp
│   │   ├── Minimum Time to Collect All Apples in a Tree.cpp
│   │   ├── Number of Enclaves.cpp
│   │   ├── Number of Islands.cpp
│   │   ├── Number of Provinces.cpp
│   │   ├── Number of closed Islands.cpp
│   │   ├── Rotting Oranges.cpp
│   │   ├── Steps by Knight.cpp
│   │   ├── Surrounded Regions.cpp
│   │   ├── Time Needed to Inform All Employees.cpp
│   │   ├── Topological sort .cpp
│   │   └── Topological sort using dfs.cpp
│   ├── Hashing/
│   │   ├── Check if two arrays are equal or not.cpp
│   │   ├── Custom Sort String.cpp
│   │   ├── First Repeating Element.cpp
│   │   ├── Group Anagrams.cpp
│   │   ├── Intersection of two arrays.cpp
│   │   ├── Key Pair.cpp
│   │   ├── LFU Cache.cpp
│   │   ├── Non-Repeating Element.cpp
│   │   ├── Pairs with Positive Negative values.cpp
│   │   ├── Relative Sort Array.cpp
│   │   ├── Sort Array by Increasing Frequency.cpp
│   │   ├── Subarray with 0 sum.cpp
│   │   ├── Winner of an election.cpp
│   │   ├── unordered_map.cpp
│   │   └── unordered_set.cpp
│   ├── Interchanging the rows of a Matrix.cpp
│   ├── Majority Element Geeksforgeeks leetcode Moore's Voting Algorithm.cpp
│   ├── Median of Two sorted arrays.cpp
│   ├── Middle of the Linked List Leetcode.cpp
│   ├── Middle of the Linked List.cpp
│   ├── Move Zeroes.cpp
│   ├── Multiply two matrices.cpp
│   ├── Naive Pattern Search.cpp
│   ├── Next Greater Element.cpp
│   ├── Non Repeating Character.cpp
│   ├── Peak element.cpp
│   ├── Rearrange Array Alternately Geeksforgeeks.cpp
│   ├── Recursion/
│   │   ├── 0-1 Knapsack Problem Top down.cpp
│   │   ├── Best Time to Buy and Sell Stock.cpp
│   │   ├── Climbing Stairs.cpp
│   │   ├── Decode Ways.cpp
│   │   ├── Delete middle element of a stack.cpp
│   │   ├── Divisor Game.cpp
│   │   ├── Factorial.cpp
│   │   ├── Fibonacci Number.cpp
│   │   ├── House Robber.cpp
│   │   ├── Largest Element in Array.cpp
│   │   ├── Min Cost Climbing Stairs.cpp
│   │   ├── Nth Fibonacci Number.cpp
│   │   ├── Partition Equal Subset Sum.cpp
│   │   ├── Perfect Squares.cpp
│   │   ├── Perfect Sum Problem.cpp
│   │   ├── Power Of Numbers.cpp
│   │   ├── Print 1 To N Without Loop.cpp
│   │   ├── Reverse a String.cpp
│   │   ├── Subset Sum Problem.cpp
│   │   ├── Sum of Array.cpp
│   │   ├── Target Sum.cpp
│   │   └── Tower Of Hanoi.cpp
│   ├── Reverse Linked List.cpp
│   ├── Rotate Array Leetcode.cpp
│   ├── Rotate List.cpp
│   ├── Search in a row-column sorted Matrix.cpp
│   ├── Single Number Leetcode solution.cpp
│   ├── Sort Array By Parity.cpp
│   ├── Sort Colors.cpp
│   ├── Spirally traversing a matrix.cpp
│   ├── Square root.cpp
│   ├── Subarray sum equals K.cpp
│   ├── Trapping Rain Water.cpp
│   ├── Tree/
│   │   ├── Balanced Binary Tree.cpp
│   │   ├── Binary Tree Inorder Traversal.cpp
│   │   ├── Binary Tree Right Side View.cpp
│   │   ├── Binary Tree Zigzag Level Order Traversal.cpp
│   │   ├── Children Sum Parent.cpp
│   │   ├── Construct Binary Tree from Preorder and Inorder Traversal.cpp
│   │   ├── Diameter of Binary Tree.cpp
│   │   ├── Invert Binary Tree.cpp
│   │   ├── Level Order Traversal.cpp
│   │   ├── Lowest Common Ancestor of a Binary Tree.cpp
│   │   ├── Maximum Depth of Binary Tree.cpp
│   │   ├── Populating Next Right Pointers in Each Node.cpp
│   │   ├── Subtree of Another Tree.cpp
│   │   ├── Symmetric Tree.cpp
│   │   ├── Vertical Width of a Binary Tree .cpp
│   │   └── same Tree.cpp
│   ├── count 1's in binary array.cpp
│   ├── linked-list-cycle.cpp
│   ├── linkedlist/
│   │   ├── Copy List with Random Pointer.cpp
│   │   ├── Delete Node in a Linked List.cpp
│   │   ├── Intersection of Two Linked Lists.cpp
│   │   ├── Linked List Cycle II.cpp
│   │   ├── Merge Two Sorted Lists.cpp
│   │   ├── Palindrome Linked List.cpp
│   │   ├── Remove Duplicates from Sorted List.cpp
│   │   ├── Remove Nth Node From End of List.cpp
│   │   ├── Remove duplicates from an unsorted linked list.cpp
│   │   ├── Reverse Linked List.cpp
│   │   ├── Sort List.cpp
│   │   ├── Swap Nodes in Pairs.cpp
│   │   └── Swapping Nodes in a Linked List.cpp
│   ├── stack/
│   │   ├── Evaluate Reverse Polish Notation.cpp
│   │   ├── Implement Queue using Stacks.cpp
│   │   ├── Implement Stack using Queues.cpp
│   │   ├── Largest Rectangle in Histogram.cpp
│   │   ├── Min Stack.cpp
│   │   ├── Next Greater Element I.cpp
│   │   ├── Online Stock Span.cpp
│   │   ├── Remove All Adjacent Duplicates In String.cpp
│   │   ├── Remove All Adjacent Duplicates in String II.cpp
│   │   ├── Reverse First K elements of Queue.cpp
│   │   └── Valid Parentheses.cpp
│   ├── string/
│   │   ├── Find the Index of the First Occurrence in a String.cpp
│   │   ├── Gas Station.cpp
│   │   └── Maximum Ice Cream Bars.cpp
│   └── sum of numbers in string.cpp
├── README.md
├── STL/
│   ├── Array_Algorithms_in_stl.cpp
│   ├── Binary search in STL.cpp
│   ├── List_in_STL.cpp
│   ├── Queue_in_STL.cpp
│   ├── Vectors_Functions_in_STL.cpp
│   ├── What is STL.cpp
│   ├── deque_in_STL.cpp
│   ├── pair_in_STL.cpp
│   ├── priority Queue in STL.cpp
│   ├── sort_in_STL.cpp
│   └── stack in STL data structure.cpp
├── Templates_in_c++.cpp
├── Tree/
│   ├── Binary seacrh tree
│   ├── Binary_tree.cpp
│   ├── Code of Deletion of Node in BST.cpp
│   ├── Code of Inorder Traversal.cpp
│   ├── Insertion in BST.cpp
│   ├── code of Hashing in C++.cpp
│   └── code of preorer and Postorder traversal.cpp
├── chef and Icecream.cpp
├── chef and string.cpp
└── map_in_c++