Data-Structures-and-Algorithms
π Algorithms and data structures implemented in C++
νμΌ νμκΈ°
μ΅μ’ λ²μ λ€μ΄λ‘λ (.zip)- code.cpp
- code.cpp
- code.cpp
- code.cpp
- code.cpp
- code.cpp
- code.cpp
- code.cpp
- 01.cpp
- 02.cpp
- 03a.cpp
- 03b.cpp
- 04a.cpp
- 04b.cpp
- 05a.cpp
- 05b.cpp
- 05c.cpp
- 06a.cpp
- 06b.cpp
- 07a.cpp
- 07b.cpp
- 07c.cpp
- 08a.cpp
- 08b.cpp
- 08c.cpp
- 09a.cpp
- 09b.cpp
- 09c.cpp
- 10a.cpp
- 10b.cpp
- 10c.cpp
- 10d.cpp
- 11a.cpp
- 11b.cpp
- 12a.cpp
- 12b.cpp
- 12c.cpp
- 01 bitwise operators.cpp
- 02a check kth bit.cpp
- 02b check kth bit.cpp
- 03a count set bits.cpp
- 03b count set bits.cpp
- 04a check power of two.cpp
- 04b check power of two.cpp
- 05 one odd occurring.cpp
- Bonus Question.cpp
- 06a two unique numbers.cpp
- 06b two unique numbers.cpp
- 07 generate power set.cpp
- 01 Function Calls.cpp
- 02 Basic Recursion.cpp
- 02a Guess Output.cpp
- 02b Guess Output.cpp
- 02c Guess Output.cpp
- 02d Guess Output.cpp
- 03 Print N to 1.cpp
- 04 Print 1 to N.cpp
- 05 Tail Recursion.cpp
- 06 Factorial of Number.cpp
- 07 Nth Fibonacci.cpp
- 08 Sum of N Natural Numbers.cpp
- 09 Palindrome Check using Recursion.cpp
- 10 Sum of Digits using Recursion.cpp
- 11 Rope Cutting Problem.cpp
- 12 Generate Subsets.cpp
- 13 Tower of Hanoi.cpp
- 14 Josephus Problem.cpp
- 15 Subset Sum Problem.cpp
- 16 Printing All Permutations.cpp
- 01 Linear Search.cpp
- 02 Insert.cpp
- 03 Delete.cpp
- 04 Largest Element.cpp
- 05a Second Largest Element.cpp
- 05b Second Largest Element.cpp
- 06 Check Array Sorted.cpp
- 07 Reverse Array.cpp
- 08 Remove Duplicates from Sorted Array.cpp
- 09a Move Zero to End.cpp
- 09b Move Zero to End.cpp
- 10 Left Rotate Array by One.cpp
- 11a Left Rotate Array by D Spaces.cpp
- 11b Left Rotate Array by D Spaces.cpp
- 11c Left Rotate Array by D Spaces.cpp
- 12a Leaders in Array.cpp
- 12b Leaders in Array.cpp
- 13a Maximum Difference.cpp
- 13b Maximum Difference.cpp
- 14a Frequencies in Sorted Array.cpp
- 14b Frequencies in Sorted Array.cpp
- 15 Stock Buy and Sell.cpp
- 16a Trapping Rain Water.cpp
- 16b Trapping Rain Water.cpp
- 16c Trapping Rain Water.cpp
- 17 Maximum Consecutive 1.cpp
- 18a Maximum Sub Array Sum.cpp
- 18b Maximum Sub Array Sum.cpp
- 19 Max Length Even Odd SubArray.cpp
- 20a Max Circular Subarray Sum.cpp
- 20b Max Circular Subarray Sum.cpp
- 21a Majority Element.cpp
- 21b Majority Element.cpp
- 22a Minimum Flips to make Array same.cpp
- 22b Minimum Flips to make Array same.cpp
- 23a Max Sum of K Consecutive elements.cpp
- 23b Max Sum of K Consecutive elements.cpp
- 24a Check Subarray with Given Sum.cpp
- 24b Check Subarray with Given Sum.cpp
- 25 N-Bonnaci Number.cpp
- 26a Find Query Sum.cpp
- 26b Find Query Sum.cpp
- 27a Find Equlibrium Point.cpp
- 27b Find Equlibrium Point.cpp
- 28a Find Maximum Occurring Element in Ranges.cpp
- 28b Find Maximum Occurring Element in Ranges.cpp
- 29 Split Array in 3 Equal Subarrays.cpp
- 30 Check if Subarray with Zero sum.cpp
- 31 Max Length of Subarray with Equal 0s and 1s.cpp
- Introduction.cpp
- 01a.cpp
- 01b.cpp
- 02a.cpp
- 02b.cpp
- 02c.cpp
- 03a index of last occurrence.cpp
- 03b index of last occurrence.cpp
- 03c index of last occurrence.cpp
- 04a.cpp
- 04b.cpp
- 05a.cpp
- 05b.cpp
- 06a square root.cpp
- 06b square root.cpp
- 07a search in infinite sorted array.cpp
- 07b search in infinite sorted array.cpp
- 08a search in sorted rotated array.cpp
- 08b search in sorted rotated array.cpp
- 09a peak element.cpp
- 09b peak element.cpp
- 10a pair sum.cpp
- 10b pair sum.cpp
- 11a triplet sum.cpp
- 11b triplet sum.cpp
- 12a count pairs with given sum.cpp
- 12b count pairs with given sum.cpp
- 13a count triplets with given sum.cpp
- 13b count triplets with given sum.cpp
- 14a.cpp
- 14b.cpp
- 15a.cpp
- 15b.cpp
- 16a.cpp
- 16b.cpp
- 16c.cpp
- 16d.cpp
- 16e.cpp
- 17.cpp
- 01 STL Introduction.cpp
- 01a STL Arrays.cpp
- 01b STL Vectors.cpp
- 01c STL Class.cpp
- 02a Stability of Algorithms Concept.cpp
- 02b Stability of Algorithms Examples.cpp
- 03a Bubble Sort.cpp
- 03b Bubble Sort Optimized.cpp
- 04 Selection Sort.cpp
- 05 Insertion Sort.cpp
- 06a Merge Two Sorted Arrays.cpp
- 06b Merge Two Sorted Arrays.cpp
- 07a Merge Sort Introduction.cpp
- 07b Merge Function of Merge Sort.cpp
- 07c Merge Sort.cpp
- 08a Intersection of two Sorted Arrays.cpp
- 08b Intersection of two Sorted Arrays.cpp
- 09a Union of Two Sorted Arrays.cpp
- 09b Union of Two Sorted Arrays.cpp
- 10a count inversions in array.cpp
- 10b count inversions in array.cpp
- 11a Partitioning Introduction.cpp
- 11b Partitioning Algorithms.cpp
- 12 Naive Partitioning.cpp
- 13a Lomuto Partitioning.cpp
- 13b Lomuto Partitioning.cpp
- 14a Hoare Partition.cpp
- 14b Hoare Partition.cpp
- 15a Quick Sort Introduction.cpp
- 15b Quick Sort using Lomuto Partition.cpp
- 15c Quick Sort using Hoare Partition.cpp
- 20a Minimum Difference in Array.cpp
- 20b Minimum Difference in Array.cpp
- 01a Fixed Size Arrays.cpp
- 01b Variable Size Arrays.cpp
- 01c Double Pointer.cpp
- 01d Array of Pointers.cpp
- 01e Array of Vectors.cpp
- 01f Vector of Vectors.cpp
- 02 Snake Pattern.cpp
- 03 Boundary Traversal.cpp
- 04a Transpose.cpp
- 04b Transpose.cpp
- 05 Rotate.cpp
- 06 Spiral Traversal.cpp
- 07 Search in Row and Column wise Sorted Matrix.cpp
- 08a Median of Row Wise Sorted Matrix.cpp
- 08b Median of Row Wise Sorted Matrix.cpp
- 01 Unordered Set.cpp
- 02 Unordered Map.cpp
- 03a Count Distinct.cpp
- 03b Count Distinct.cpp
- 04a Frequencies of Elements.cpp
- 04b Frequencies of Elements.cpp
- 05a Intersection of Arrays.cpp
- 05b Intersection of Arrays.cpp
- 05c Intersection of Arrays.cpp
- 06 Union of Arrays.cpp
- 07a Pair with given Sum.cpp
- 07b Pair with given Sum.cpp
- 08a SubArray with Zero Sum.cpp
- 08b SubArray with Zero Sum.cpp
- 09a SubArray with given Sum.cpp
- 09b SubArray with given Sum.cpp
- 10a Longest SubArray with given Sum.cpp
- 10b Longest SubArray with given Sum.cpp
- 11a Longest SubArray with equal 0s and 1s.cpp
- 11b Longest SubArray with equal 0s and 1s.cpp
- 12a Longest Common Span with Same Sum in Binary Array.cpp
- 13a Longest Consecutive SubSequence.cpp
- 14a Count Distinct Elements in Window of size K.cpp
- 14b Count Distinct Elements in Window of size K.cpp
- 14c Count Distinct Elements in Window of size K.cpp
- 15a More Than N k Occurences.cpp
- 15b More Than N k Occurences.cpp
- Introduction.cpp
- 01 ASCII Values.cpp
- 02a Printing ASCII Values.cpp
- 02b Printing ASCII Values.cpp
- 02c Printing ASCII Values.cpp
- 03 Print Frequencies of Character in String.cpp
- 04a Strings in C.cpp
- 04b Strings in C.cpp
- 05 Strings in CPP.cpp
- 06a Taking Input.cpp
- 06b Taking Input.cpp
- 06c Taking Input.cpp
- 07 Iterating Strings.cpp
- 08a Palindrome Check.cpp
- 08b Palindrome Check.cpp
- 09a Validate Subsequence.cpp
- 09b Validate Subsequence.cpp
- 10a Check for Anagram.cpp
- 10b Check for Anagram.cpp
- 11a Leftmost Repeating Character.cpp
- 11b Leftmost Repeating Character.cpp
- 12a Leftmost Non Repeating Character.cpp
- 12b Leftmost Non Repeating Character.cpp
- 13a Reverse Words in String.cpp
- 13b Reverse Words in String.cpp
- 14a Check if Strings are Rotation.cpp
- 14b Check if Strings are Rotation.cpp
- 15a Anagram Search.cpp
- 15b Anagram Search.cpp
- 16a Naive Pattern Searching.cpp
- 16b Naive Pattern Searching.cpp
- 17a Lexiographic Rank of a String.cpp
- 18a Longest Substring with Distinct Characters.cpp
- 18b Longest Substring with Distinct Characters.cpp
- 18c Longest Substring with Distinct Characters.cpp
- 01 Linked List Class.cpp
- 02 Iterative Traversal.cpp
- 03 Recursive Traversal.cpp
- 04 Insert at Head.cpp
- 05 Insert At Tail.cpp
- 06 Delete At Head.cpp
- 07 Delete At Tail.cpp
- 08 Insert At Given Position.cpp
- 09 Iterative Search.cpp
- 10 Recursive Search.cpp
- 11 Doubly Linked List Class.cpp
- 12 Insert At Head Doubly LL.cpp
- 13 Insert At Tail Doubly LL.cpp
- 14 Reverse Doubly LL.cpp
- 15 Delete At Head Doubly LL.cpp
- 16 Delete At Tail Doubly LL.cpp
- 17 Circular Linked List Class.cpp
- 18 Traversing Ciruclar LL.cpp
- 19a Insert At Head Circular LL.cpp
- 19b Insert At Head Circular LL.cpp
- 20 Insert At Tail Circular LL.cpp
- 21 Delete At Head Circular LL.cpp
- 22 Delete Kth Node in Circular LL.cpp
- 23 Circular Doubly Linked List.cpp
- 24 Sorted Insert in LL.cpp
- 25a Middle Of Linked List.cpp
- 25b Middle Of Linked List.cpp
- 26a Find Nth Node From End Of LL.cpp
- 26b Find Nth Node From End Of LL.cpp
- 27a Iterative Reverse of LL.cpp
- 27b Iterative Reverse of LL.cpp
- 28 Recursive Reverse of LL.cpp
- 29 Remove Duplicates from Sorted LL.cpp
- 30a Reverse LL in group size of K.cpp
- 30b Reverse LL in group size of K.cpp
- 31a Detect Loop.cpp
- 31b Detect Loop.cpp
- 32 Detect Loop Using Floyd Cycle Detection.cpp
- 33 Detect and Remove Loop.cpp
- 34 Delete Node With Only Pointer Given.cpp
- 35 Segregate Even Odd Nodes of LL.cpp
- 36a Intersection Point of Two Linked Lists.cpp
- 36b Intersection Point of Two Linked Lists.cpp
- 37 Pairwise Node Swap of LL.cpp
- 38a Clone a LL with Random Pointer.cpp
- 40 Merge Two Sorted LL.cpp
- 41 Palindrome Linked List.cpp
- 01 Introduction.cpp
- 02a Implementation using Arrays.cpp
- 02b Implementation using Vectors.cpp
- 02c Implementation using Linked List.cpp
- 03 STL.cpp
- 04 Balanced Parentheses.cpp
- 05 Two Stacks in an Array.cpp
- 06 K Stacks in an Array.cpp
- 07a Stock Span Problem.cpp
- 07b Stock Span Problem.cpp
- 08a Previous Greater Element.cpp
- 08b Previous Greater Element.cpp
- 09a Next Greater Element.cpp
- 09b Next Greater Element.cpp
- 10a Largest Rectangluar Area.cpp
- 10b Largest Rectangluar Area.cpp
- 12a Design Stack with getMin in O(1).cpp
- 12b Design Stack with getMin in O(1).cpp
- 01_Introduction.cpp
- 02_Queue_STL.cpp
- 03_Implement_Stack_using_Queue.cpp
- 04_Reversing_Queue_Iterative.cpp
- 05_Reversing_Queue_Recursive.cpp
- 06_Generate_Number_with_Given_Digits.cpp
- 01.cpp
- 02.cpp
- 03.cpp
- 04.cpp
- 05a.cpp
- 05b.cpp
- 06a.cpp
- 06b.cpp
- 01.cpp
- 02.cpp
- 03.cpp
- 04.cpp
- 05.cpp
- 06.cpp
- 07.cpp
- 08.cpp
- 09a.cpp
- 09b.cpp
- 10a.cpp
- 10b.cpp
- 10c.cpp
- 11a.cpp
- 11b.cpp
- 12a.cpp
- 12b.cpp
- 13a.cpp
- 13b.cpp
- 14.cpp
- 15a.cpp
- 15b.cpp
- 16.cpp
- 17.cpp
- 19a.cpp
- 19b.cpp
- 20.cpp
- 21a.cpp
- 21b.cpp
- 22.cpp
- 23a.cpp
- 23b.cpp
- 24.cpp
- 24.cpp
- 01a Search in BST.cpp
- 01b Search in BST.cpp
- 02a Insert in BST.cpp
- 02b Insert in BST.cpp
- 03 Delete in BST.cpp
- 04 Floor in BST.cpp
- 05 Ceil in BST.cpp
- 06 Self Balancing BST.cpp
- 07 AVL Tree.cpp
- 08 Red Black Tree.cpp
- 09a Set STL.cpp
- 09b Set STL.cpp
- 09c Set STL.cpp
- 10a Map STL.cpp
- 10b Map STL.cpp
- 10c Map STL.cpp
- 01 Introduction.cpp
- 02 Implementation.cpp
- 03 Insert.cpp
- 04 Heapify.cpp
- 05 Extract Min.cpp
- 06 Decrease Key.cpp
- 07 Delete.cpp
- 08 Build Heap.cpp
- 09 Heap Sort.cpp
- 10a Priority Queue STL.cpp
- 10b Priority Queue STL.cpp
- 10c Priority Queue STL.cpp
- 10d Priority Queue STL.cpp
- 11a Sort K-Sorted Array.cpp
- 11b Sort K-Sorted Array.cpp
- 12a Purchasing Maximum Items.cpp
- 12b Purchasing Maximum Items.cpp
- 13a K-Largest Element.cpp
- 13b K-Largest Element.cpp
- 14a K-Closest Elements.cpp
- 14b K-Closest Elements.cpp
- 15a Merge K Sorted Arrays.cpp
- 15b Merge K Sorted Arrays.cpp
- 16a Median in Stream.cpp
- 16b Median in Stream.cpp
- 01 Graphs Introduction.cpp
- 02a Graphs Representation.cpp
- 02b Graphs Representation.cpp
- 03a Graphs Implementation.cpp
- 03b Graphs Implementation.cpp
- 04a Breadth First Search.cpp
- 04b Breadth First Search.cpp
- 04c Breadth First Search.cpp
- 05a Depth First Search.cpp
- 05b Depth First Search.cpp
- 05c Depth First Search.cpp
- 06 Shortest Path in Unweighted Graph.cpp
- 08 Topological Sorting.cpp
- 01 Minimum Coins.cpp
- 02 Activity Selection.cpp
- 03 Fractional Knapsack.cpp
- 04 Job Sequencing.cpp
- 05 Huffman Coding.cpp
- 01a Print Permutations of Strings with Given Condition.cpp
- 01b Print Permutations of Strings with Given Condition.cpp
- 02 Rat in a Maze.cpp
- 01 Introduction.cpp
- 02a Nth Fibonacci.cpp
- 02b Nth Fibonacci.cpp
- 02c Nth Fibonacci.cpp
- 03a Longest Common Subsequence.cpp
- 03b Longest Common Subsequence.cpp
- 03c Longest Common Subsequence.cpp
- 04a Coin Change.cpp
- 04b Coin Change.cpp
- 04c Coin Change.cpp
- 05a Edit Distance.cpp
- 05b Edit Distance.cpp
- 05c Edit Distance.cpp
- 06a Maximum Sum with no 2 Consecutive.cpp
- 06b Maximum Sum with no 2 Consecutive.cpp
- 06c Maximum Sum with no 2 Consecutive.cpp
- 01 Introduction.cpp
- 02 Trie Representation.cpp
- 03 Trie Delete.cpp
- .gitignore
- LICENSE
- logo.png
- README.md
// repository documentation
Was this content helpful?
(0 ratings)