{"id":19094016,"url":"https://github.com/gaurav-chaurasia/dsa","last_synced_at":"2026-05-25T21:30:16.500Z","repository":{"id":49723455,"uuid":"266275066","full_name":"gaurav-chaurasia/DSA","owner":"gaurav-chaurasia","description":"All my practice problem(data-structure and algorithmic) and code are here ","archived":false,"fork":false,"pushed_at":"2021-09-24T06:37:23.000Z","size":1008,"stargazers_count":1,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-02T23:33:54.989Z","etag":null,"topics":["algorithm","competitive-programming","cpp","data-structures","readme-md"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gaurav-chaurasia.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-05-23T06:13:25.000Z","updated_at":"2021-09-24T06:37:26.000Z","dependencies_parsed_at":"2022-09-09T13:40:42.217Z","dependency_job_id":null,"html_url":"https://github.com/gaurav-chaurasia/DSA","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gaurav-chaurasia%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gaurav-chaurasia%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gaurav-chaurasia%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gaurav-chaurasia%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gaurav-chaurasia","download_url":"https://codeload.github.com/gaurav-chaurasia/DSA/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240142923,"owners_count":19754646,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","competitive-programming","cpp","data-structures","readme-md"],"created_at":"2024-11-09T03:27:12.682Z","updated_at":"2026-05-25T21:30:16.407Z","avatar_url":"https://github.com/gaurav-chaurasia.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# _________________________DSA_________________________\n[![Generic badge](https://img.shields.io/badge/language-c++-green.svg)](https://github.com/gaurav-chaurasia/)  [![Ask Me Anything !](https://img.shields.io/badge/Ask%20me-anything-1abc9c.svg)](https://gaurav-chaurasia.github.io/)   \n\u003e Ubuntu 18.04 LTS.  \n\u003e Windows Subsystem for Linux 2 (Ubuntu 20.04 LTS)\n\n- All the imp concept and notes can be found in the [`NOTES`](NOTES/.NOTES.markdown) folder\n    - [SNIPPET](NOTES/.SNIPPET.markdown)\n    - [TOPICS](NOTES/.TOPICS.markdown)\n    - [NOTES](NOTES/.NOTES.markdown)\n    - [headers](NOTES/headers.md)\n    - [define](NOTES/define.md)\n    - [maths](NOTES/mathematics.md) \n    - [bitset](NOTES/bitset.md)\n    - [string](NOTES/string.md)\n    - [deque](NOTES/deque.md)\n    - [queue](NOTES/queue.md)\n    - [list](NOTES/list.md) \n    - [stack](NOTES/stack.md) \n    - [tuple](NOTES/tuple.md) \n    - [utility](NOTES/utility.md) \n    - [vector](NOTES/vector.md) \n    - [iterator](NOTES/iterator.md) \n    - [algorithm](NOTES/algorithm.md) \n    - [smart_pointer and memory](NOTES/smart_pointer.md) \n    - map and multimap\n        - [#include \u003cmap\u003e](NOTES/map.md)\n        - [#include \u003cunordered_map\u003e](NOTES/map.md) \n    - set and multiset\n        - [#include \u003cset\u003e](NOTES/set.md) \n        - [#include \u003cunordered_set\u003e](NOTES/set.md) \n    - [bit-magic](NOTES/bitmasking.md)\n    - [LIMITS, MAX, MIN ...](NOTES/limit.md) \n\n\n- Many imp Algorithms and their implementation can be found in the `ALGORITHM` folder\n     - `ALGO`\n       ALGORITHM | README | CODE\n       --- | --- | ---\n       `Kadane's Algorithm` |  | [CODE](ALGORITHM/kadane’s_algorithm.cpp) \n       `Merge Sort` |  | [CODE](ALGORITHM/merge_sort.cpp)\n       `Quick Sort` | [README](ALGORITHM/docs/quick_sort.md) | [CODE](ALGORITHM/quick_sort.cpp)\n       `Moore's Voting` | [README](ALGORITHM/docs/Moore's_Voting.md) |  [CODE](ALGORITHM/Moore's_Voting.cpp)\n       `Euclidean Algorithms` | [README](ALGORITHM/docs/euclidean_algorithms.md) |  [CODE](ALGORITHM/euclidean_algorithms.cpp)\n       `Kahn's Algorithms` | [README](ALGORITHM/docs/kahn_algorithm.md) |  [CODE](ALGORITHM/kahn_algorithm.cpp)\n       `Dijkstra's Algorithms` |  |  [CODE](ALGORITHM/dijkstras_algorithm.cpp)\n       `Bellman Ford Algorithms` |  |  [CODE](ALGORITHM/bellman_ford.cpp)\n       `Prim's Algorithms` |  |  [CODE](ALGORITHM/prims_algorithm.cpp)\n\n     - `DS`\n       DATA-STRUCTURE | README | CODE\n       --- | --- | ---\n       `Disjoint Set Union` | [README](DS/docs/disjoint_set_union.md) | [CODE](DS/disjoint_set_union.cpp) \n\n\n\u003cbr\u003e  \n\n\u003e ### ``IMP``\n\u003e - Problems full of concepts  \n\u003e - or one of it's kind  \n\u003e  \n\u003e QUESTIONS | CODE | TAGS  \n\u003e  --- | --- | ---\n\u003e  \u003ca href=\"https://codeforces.com/contest/1516/problem/D\"\u003ecut\u003c/a\u003e | \u003ca href=\"https://github.com/gaurav-chaurasia/DSA/blob/master/contest/codeforces/R%23720/d.cpp\"\u003eCODE\u003c/a\u003e `NC` | `GCD` `LCM` `Prime Factors` `DP` `Binary Lifting` `Sieve`   \n\u003e  \u003ca href=\"https://practice.geeksforgeeks.org/problems/count-occurences-of-anagrams5839/1\"\u003ecount_occurrences_of_anagrams\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e `C` | `Sliding-Window` `Map`   \n\u003e  \u003ca href=\"https://www.codechef.com/COOK129B/problems/TLAPM\"\u003ethe_last_problem\u003c/a\u003e | \u003ca href=\"https://github.com/gaurav-chaurasia/DSA/tree/master/contest/codechef/COOK129B/a.cpp\"\u003eCODE\u003c/a\u003e `C` | `Grid` `Series` `Pattern`   \n\u003e\n\n\u003cbr\u003e  \n\n### `TOPICS`     \n\u003e #### ``Stack``\n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  max_area_histogram | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/max_area_histogram.cpp\"\u003eCODE\u003c/a\u003e\n\u003e  max_area_rect_binary_matrix | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/max_area_rect_binary_matrix.cpp\"\u003eCODE\u003c/a\u003e\n\u003e  min_element_in_stack | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/min_element_in_stack.cpp\"\u003eCODE\u003c/a\u003e\n\u003e  next_largest_element | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/next_largest_element.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  next_smallest_element | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/next_smallest_element.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  rain_water_trapping | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/rain_water_trapping.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  stock_span_problem | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/stack/stock_span_problem.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``Heap``\n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  k_closest_number | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/heap/k_closest_number.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  k_largest_element | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/heap/k_largest_element.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  k_smallest_element | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/heap/k_smallest_element.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  sort_k_sorted_array | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/heap/sort_k_sorted_array.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  connect_rope_to_minimize_cost | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/heap/connect_rope_to_minimize_cost.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``DP`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  **knapsack** |  |   \n\u003e  knapsack | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/knapsack/knapsack.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  count_number_of_subset_with_given_difference | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/count_number_of_subset_with_given_difference.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  equal_sum_partition | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/knapsack/equal_sum_partition.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  count_subset_with_given_sum | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/knapsack/count_subset_with_given_sum.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  minimum_subset_sum_diffrence | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/knapsack/minimum_subset_sum_diffrence.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  subset_sum | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/knapsack/subset_sum.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  target_sum | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/knapsack/target_sum.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  **unbounded_knapsack** |  |   \n\u003e  coin_change_1 | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/unbounded_knapsack/coin_change_1.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  coin_change_2 | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/unbounded_knapsack/coin_change_2.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  rod_cutting_problem | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/unbounded_knapsack/rod_cutting_problem.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  **Longest Common Subsequence** | **LIS** |   \n\u003e  longest_common_subsequence | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/longest_common_subsequence.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  longest_common_subtring | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/longest_common_subtring.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  longest_palindromic_subsequence | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/longest_palindromic_subsequence.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  longest_repeating_subsequence | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/longest_repeating_subsequence.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  minimum_deletion_to_make_palindrome | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/minimum_deletion_to_make_palindrome.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  minimum_insertion_and_deletion_to_convert | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/minimum_insertion_and_deletion_to_convert.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  print_longest_common_subsequence | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/print_longest_common_subsequence.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  subsequence_pattern_matching | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/subsequence_pattern_matching.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  shortest_common_super_sequence | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/shortest_common_super_sequence.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  edit_distance | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/edit_distance.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  **Matrix Chain Multiplication** | **MCM** |   \n\u003e  egg_dropping | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/egg_dropping.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  evaluate_expression | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/evaluate_expression.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  matrix_chain_multiplication | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/matrix_chain_multiplication.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  palindrom_partitioning | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/palindrom_partitioning.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  scrambeld_string | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/LCS/scrambeld_string.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  **DP on Tree** |  |\n\u003e  diameter_binary_tree | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/trees/diameter_binary_tree.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  **Others** | **Mixed** |   \n\u003e  fib | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/others/fib.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  LIS | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/others/LIS.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\n\u003e #### ``SLIDING_WINDOW`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  **Fixed Size** |  |   \n\u003e  count_occurrences_of_anagrams | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/fixed/count_occurrences_of_anagrams.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  first_negative_in_window_of_size_k | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/fixed/first_negative_in_window_of_size_k.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  maximum_sum_subarray_of_size_k | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/fixed/maximum_sum_subarray_of_size_k.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  maximum_of_all_subarray_of_size_k | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/fixed/maximum_of_all_subarray_of_size_k.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  **Variable Size** |  |   \n\u003e  count_of_anagram_string | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/variable/count_of_anagram_string.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  largest_subarray_of_sum_k | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/variable/largest_subarray_of_sum_k.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  largest_subarray_with_k_unique_char | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/variable/largest_subarray_with_k_unique_char.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  longest_substring_with_no_repeat | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/variable/longest_substring_with_no_repeat.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  minimum_window_substring | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/variable/minimum_window_substring.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  pick_toy | \u003ca href=\"\"\u003e\u003c/a\u003e | \u003ca href=\"topics/dp/sliding_window/variable/pick_toy.cpp\"\u003eCODE\u003c/a\u003e  \n \n\n\u003e #### ``RECURSION`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  climb_stairs | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/climb_stairs.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  connected_flowers | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/connected_flowers.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  delete_middle_element_stack | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/delete_middle_element_stack.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  generate_balanced_parentheses | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/generate_balanced_parentheses.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  height_binary_tree | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/height_binary_tree.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  josephus_problem | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/josephus_problem.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  kth_symbol_grammer | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/kth_symbol_grammer.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  letter_case_permutation | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/letter_case_permutation.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  pascals_triangle | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/pascals_triangle.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  permutation_with_case | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/permutation_with_case.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  permutation_with_space | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/permutation_with_space.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  print_n_digit_binary_having_more_ones | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/print_n_digit_binary_having_more_ones.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  print_nums | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/print_nums.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  print_subsets | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/print_subsets.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  reverse_stack_using_recursion | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/reverse_stack_using_recursion.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  reverse_stack_using_recursion | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/reverse_stack_using_recursion.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  sort_stack | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/sort_stack.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  sort_array | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/recursion/sort_array.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``GRAPH`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  dfs | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/dfs.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  bfs | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/bfs.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  detect_cycle_directed | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/detect_cycle_directed.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  detect_cycle_undirected | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/detect_cycle_undirected.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  shortest_path_DAG | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/shortest_path_DAG.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  shortest_path_undirected | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/shortest_path_undirected.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  topo_sort | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/topo_sort.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  weird_connection | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/graph/weird_connection.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\n\u003e #### ``LINKED_LIST`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  reverse | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/reverse.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  detect_loop | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/detect_loop.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  find_middle | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/find_middle.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  intersaction | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/intersaction.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  merge_sorted_linkedlist | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/merge_sorted_linkedlist.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  remove_loop | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/remove_loop.cpp\"\u003eCODE\u003c/a\u003e  \n\u003e  reverse_in_group | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/reverse_in_group.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``LINKED_LIST`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  reverse | \u003ca href=\"#\"\u003e\u003c/a\u003e | \u003ca href=\"topics/linked_list/reverse.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``RANDOM`` \n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  minimum_swaps_and_K_together | \u003ca href=\"https://github.com/gaurav-chaurasia/DSA/blob/master/practice/doc/random/min_swap_k_together.md\"\u003eREADME\u003c/a\u003e | \u003ca href=\"https://github.com/gaurav-chaurasia/DSA/blob/master/practice/random/min_swap_k_together.cpp\"\u003eCODE\u003c/a\u003e  \n\n\n\n\u003cbr\u003e  \n\n### `CSES` `PROBLEMS`   \n\u003e #### ``Introductory ✔``\n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  Apple Division | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e\n\u003e  Bit Strings | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e\n\u003e  Chessboard and Queens | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e\n\u003e  Coin Piles | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Creating String 1 | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Grid Path ✖ | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Increasing Array | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Missing Number | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Number Spiral | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Palindrome Reorder | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Permutations | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Repetitions | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Trailing Zeros | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Two Sets | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Weird Algorithm | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``Sorting and Searching``\n\u003e QUESTIONS | README | CODE\n\u003e  --- | --- | ---\n\u003e  Apartments | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e\n\u003e  Concert Tickets | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e\n\u003e  Distinct Number | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e\n\u003e  Ferris Wheel | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Resturent Customers 👁‍🗨 | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Max Subarray Sum | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Movie Festival | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Sum of Two Value | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Stick Length | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\u003e  Missing Coin Sum 👁‍🗨 | \u003ca href=\"#\"\u003eREADME\u003c/a\u003e | \u003ca href=\"#\"\u003eCODE\u003c/a\u003e  \n\n\n\u003e #### ``Mathematics``\n\u003e \n\u003e \n\n\n\u003e #### ``Dynamic Programming``\n\u003e \n\u003e \n\n\n\u003e #### ``Graphs``\n\u003e \n\u003e \n\n\n\u003e #### ``Range Queries``\n\u003e \n\u003e \n\n\n\u003e #### ``String Algorithms``\n\u003e \n\u003e \n\n\n\u003e #### ``Additional``\n\u003e \n\u003e \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgaurav-chaurasia%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgaurav-chaurasia%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgaurav-chaurasia%2Fdsa/lists"}