Data Structures and Algorithms in C++

This repository contains implementations of various data structures and algorithms in C++. It's a collection of code examples, templates, and explanations to help you understand and practice DSA in C++.

Introduction

Data Structures and Algorithms are fundamental concepts in computer science and software development. This repository is a resource for learning and practicing these concepts in C++. You'll find various data structures like arrays, linked lists, trees, and heaps, along with algorithms for searching, sorting, and more.

Data Structures

This section includes implementations and explanations of common data structures such as:

Algorithms

Here you'll find algorithms for various tasks like sorting, searching, and more. Some of the algorithms covered include:

Usage

You can use the code examples and explanations in this repository to learn and practice DSA in C++. Each data structure and algorithm is organized in its respective folder and comes with code examples and explanations.

To run the C++ code, make sure you have a C++ compiler installed. You can compile and run the programs using the following commands:

g++ filename.cpp -o output
./output

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data Structures and Algorithms in C++

Table of Contents

Introduction

Data Structures

Algorithms

Usage

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 929 Commits
.vscode		.vscode
1016-subarray-sums-divisible-by-k		1016-subarray-sums-divisible-by-k
1029-vertical-order-traversal-of-a-binary-tree		1029-vertical-order-traversal-of-a-binary-tree
1037-minimum-number-of-k-consecutive-bit-flips		1037-minimum-number-of-k-consecutive-bit-flips
1137-height-checker		1137-height-checker
1138-grumpy-bookstore-owner		1138-grumpy-bookstore-owner
1196-filling-bookcase-shelves		1196-filling-bookcase-shelves
1197-parsing-a-boolean-expression		1197-parsing-a-boolean-expression
1207-delete-nodes-and-return-forest		1207-delete-nodes-and-return-forest
1217-relative-sort-array		1217-relative-sort-array
1228-minimum-cost-tree-from-leaf-values		1228-minimum-cost-tree-from-leaf-values
1256-rank-transform-of-an-array		1256-rank-transform-of-an-array
1263-number-of-dice-rolls-with-target-sum		1263-number-of-dice-rolls-with-target-sum
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
131-palindrome-partitioning		131-palindrome-partitioning
1325-path-with-maximum-probability		1325-path-with-maximum-probability
1331-path-with-maximum-gold		1331-path-with-maximum-gold
1333-sort-the-jumbled-numbers		1333-sort-the-jumbled-numbers
1350-remove-sub-folders-from-the-filesystem		1350-remove-sub-folders-from-the-filesystem
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
1381-maximum-score-words-formed-by-letters		1381-maximum-score-words-formed-by-letters
1435-xor-queries-of-a-subarray		1435-xor-queries-of-a-subarray
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1450-delete-leaves-with-a-given-value		1450-delete-leaves-with-a-given-value
1473-find-the-longest-substring-containing-vowels-in-even-counts		1473-find-the-longest-substring-containing-vowels-in-even-counts
1484-linked-list-in-binary-tree		1484-linked-list-in-binary-tree
1497-design-a-stack-with-increment-operation		1497-design-a-stack-with-increment-operation
1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one		1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit		1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1553-count-triplets-that-can-form-two-arrays-of-equal-xor		1553-count-triplets-that-can-form-two-arrays-of-equal-xor
1556-make-two-arrays-equal-by-reversing-subarrays		1556-make-two-arrays-equal-by-reversing-subarrays
1605-minimum-number-of-days-to-make-m-bouquets		1605-minimum-number-of-days-to-make-m-bouquets
1615-range-sum-of-sorted-subarray-sums		1615-range-sum-of-sorted-subarray-sums
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves		1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1620-check-if-array-pairs-are-divisible-by-k		1620-check-if-array-pairs-are-divisible-by-k
1675-magnetic-force-between-two-balls		1675-magnetic-force-between-two-balls
1691-minimum-number-of-days-to-disconnect-island		1691-minimum-number-of-days-to-disconnect-island
1694-make-sum-divisible-by-p		1694-make-sum-divisible-by-p
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable		1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
1711-find-valid-matrix-given-row-and-column-sums		1711-find-valid-matrix-given-row-and-column-sums
1715-split-a-string-into-the-max-number-of-unique-substrings		1715-split-a-string-into-the-max-number-of-unique-substrings
1730-special-array-with-x-elements-greater-than-or-equal-x		1730-special-array-with-x-elements-greater-than-or-equal-x
1741-sort-array-by-increasing-frequency		1741-sort-array-by-increasing-frequency
1786-count-the-number-of-consistent-strings		1786-count-the-number-of-consistent-strings
179-largest-number		179-largest-number
1916-find-center-of-star-graph		1916-find-center-of-star-graph
1923-sentence-similarity-iii		1923-sentence-similarity-iii
1993-sum-of-all-subset-xor-totals		1993-sum-of-all-subset-xor-totals
2006-find-the-student-that-will-replace-the-chalk		2006-find-the-student-that-will-replace-the-chalk
2035-count-sub-islands		2035-count-sub-islands
2054-the-number-of-the-smallest-unoccupied-chair		2054-the-number-of-the-smallest-unoccupied-chair
2076-sum-of-digits-of-string-after-convert		2076-sum-of-digits-of-string-after-convert
2095-minimum-number-of-swaps-to-make-the-string-balanced		2095-minimum-number-of-swaps-to-make-the-string-balanced
2132-convert-1d-array-into-2d-array		2132-convert-1d-array-into-2d-array
214-shortest-palindrome		214-shortest-palindrome
2148-minimum-number-of-moves-to-seat-everyone		2148-minimum-number-of-moves-to-seat-everyone
2155-find-missing-observations		2155-find-missing-observations
2163-kth-distinct-string-in-an-array		2163-kth-distinct-string-in-an-array
2171-second-minimum-time-to-reach-destination		2171-second-minimum-time-to-reach-destination
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points		2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2217-step-by-step-directions-from-a-binary-tree-node-to-another		2217-step-by-step-directions-from-a-binary-tree-node-to-another
2255-minimum-swaps-to-group-all-1s-together-ii		2255-minimum-swaps-to-group-all-1s-together-ii
2299-merge-nodes-in-between-zeros		2299-merge-nodes-in-between-zeros
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
2306-create-binary-tree-from-descriptions		2306-create-binary-tree-from-descriptions
2323-minimum-bit-flips-to-convert-number		2323-minimum-bit-flips-to-convert-number
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
241-different-ways-to-add-parentheses		241-different-ways-to-add-parentheses
2416-evaluate-boolean-binary-tree		2416-evaluate-boolean-binary-tree
2444-longest-ideal-subsequence		2444-longest-ideal-subsequence
2454-largest-local-values-in-a-matrix		2454-largest-local-values-in-a-matrix
2472-build-a-matrix-with-conditions		2472-build-a-matrix-with-conditions
2488-divide-intervals-into-minimum-number-of-groups		2488-divide-intervals-into-minimum-number-of-groups
2494-sum-of-prefix-scores-of-strings		2494-sum-of-prefix-scores-of-strings
2502-sort-the-people		2502-sort-the-people
2503-longest-subarray-with-maximum-bitwise-and		2503-longest-subarray-with-maximum-bitwise-and
2545-height-of-binary-tree-after-subtree-removal-queries		2545-height-of-binary-tree-after-subtree-removal-queries
2572-append-characters-to-string-to-make-subsequence		2572-append-characters-to-string-to-make-subsequence
2581-divide-players-into-teams-of-equal-skill		2581-divide-players-into-teams-of-equal-skill
2616-maximal-score-after-applying-k-operations		2616-maximal-score-after-applying-k-operations
264-ugly-number-ii		264-ugly-number-ii
2645-pass-the-pillow		2645-pass-the-pillow
2677-cousins-in-binary-tree-ii		2677-cousins-in-binary-tree-ii
2696-the-number-of-beautiful-subsets		2696-the-number-of-beautiful-subsets
2727-number-of-senior-citizens		2727-number-of-senior-citizens
273-integer-to-english-words		273-integer-to-english-words
279-perfect-squares		279-perfect-squares
2800-minimum-string-length-after-removing-substrings		2800-minimum-string-length-after-removing-substrings
2803-modify-graph-edge-weights		2803-modify-graph-edge-weights
2846-robot-collisions		2846-robot-collisions
2914-find-the-safest-path-in-a-grid		2914-find-the-safest-path-in-a-grid
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
3235-minimum-cost-to-convert-string-i		3235-minimum-cost-to-convert-string-i
3291-find-if-array-can-be-sorted		3291-find-if-array-can-be-sorted
330-patching-array		330-patching-array
3307-find-the-maximum-sum-of-node-values		3307-find-the-maximum-sum-of-node-values
3329-find-the-length-of-the-longest-common-prefix		3329-find-the-length-of-the-longest-common-prefix
3351-maximize-happiness-of-selected-children		3351-maximize-happiness-of-selected-children
3501-delete-nodes-from-linked-list-present-in-array		3501-delete-nodes-from-linked-list-present-in-array
386-lexicographical-numbers		386-lexicographical-numbers

prakhar7017/DSA-CPP

Folders and files

Latest commit

History

Repository files navigation

Data Structures and Algorithms in C++

Table of Contents

Introduction

Data Structures

Algorithms

Usage

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages