Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/gaurav-chaurasia/dsa

All my practice problem(data-structure and algorithmic) and code are here
https://github.com/gaurav-chaurasia/dsa

algorithm competitive-programming cpp data-structures readme-md

Last synced: 7 days ago
JSON representation

All my practice problem(data-structure and algorithmic) and code are here

Host: GitHub
URL: https://github.com/gaurav-chaurasia/dsa
Owner: gaurav-chaurasia
Created: 2020-05-23T06:13:25.000Z (over 4 years ago)
Default Branch: master
Last Pushed: 2021-09-24T06:37:23.000Z (about 3 years ago)
Last Synced: 2023-03-06T21:40:20.508Z (over 1 year ago)
Topics: algorithm, competitive-programming, cpp, data-structures, readme-md
Language: C++
Homepage:
Size: 984 KB
Stars: 1
Watchers: 2
Forks: 2
Open Issues: 0
Metadata Files:
- Readme: README.md

Awesome Lists containing this project

README

        # _________________________DSA_________________________

[![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/)   

> Ubuntu 18.04 LTS.  

> Windows Subsystem for Linux 2 (Ubuntu 20.04 LTS)

- All the imp concept and notes can be found in the [`NOTES`](NOTES/.NOTES.markdown) folder

    - [SNIPPET](NOTES/.SNIPPET.markdown)

    - [TOPICS](NOTES/.TOPICS.markdown)

    - [NOTES](NOTES/.NOTES.markdown)

    - [headers](NOTES/headers.md)

    - [define](NOTES/define.md)

    - [maths](NOTES/mathematics.md) 

    - [bitset](NOTES/bitset.md)

    - [string](NOTES/string.md)

    - [deque](NOTES/deque.md)

    - [queue](NOTES/queue.md)

    - [list](NOTES/list.md) 

    - [stack](NOTES/stack.md) 

    - [tuple](NOTES/tuple.md) 

    - [utility](NOTES/utility.md) 

    - [vector](NOTES/vector.md) 

    - [iterator](NOTES/iterator.md) 

    - [algorithm](NOTES/algorithm.md) 

    - [smart_pointer and memory](NOTES/smart_pointer.md) 

    - map and multimap

        - [#include ](NOTES/map.md)

        - [#include ](NOTES/map.md) 

    - set and multiset

        - [#include ](NOTES/set.md) 

        - [#include ](NOTES/set.md) 

    - [bit-magic](NOTES/bitmasking.md)

    - [LIMITS, MAX, MIN ...](NOTES/limit.md) 

- Many imp Algorithms and their implementation can be found in the `ALGORITHM` folder

     - `ALGO`

       ALGORITHM | README | CODE

       --- | --- | ---

       `Kadane's Algorithm` |  | [CODE](ALGORITHM/kadane’s_algorithm.cpp) 

       `Merge Sort` |  | [CODE](ALGORITHM/merge_sort.cpp)

       `Quick Sort` | [README](ALGORITHM/docs/quick_sort.md) | [CODE](ALGORITHM/quick_sort.cpp)

       `Moore's Voting` | [README](ALGORITHM/docs/Moore's_Voting.md) |  [CODE](ALGORITHM/Moore's_Voting.cpp)

       `Euclidean Algorithms` | [README](ALGORITHM/docs/euclidean_algorithms.md) |  [CODE](ALGORITHM/euclidean_algorithms.cpp)

       `Kahn's Algorithms` | [README](ALGORITHM/docs/kahn_algorithm.md) |  [CODE](ALGORITHM/kahn_algorithm.cpp)

       `Dijkstra's Algorithms` |  |  [CODE](ALGORITHM/dijkstras_algorithm.cpp)

       `Bellman Ford Algorithms` |  |  [CODE](ALGORITHM/bellman_ford.cpp)

       `Prim's Algorithms` |  |  [CODE](ALGORITHM/prims_algorithm.cpp)

     - `DS`

       DATA-STRUCTURE | README | CODE

       --- | --- | ---

       `Disjoint Set Union` | [README](DS/docs/disjoint_set_union.md) | [CODE](DS/disjoint_set_union.cpp) 


  

> ### ``IMP``

> - Problems full of concepts  

> - or one of it's kind  

>  

> QUESTIONS | CODE | TAGS  

>  --- | --- | ---

>  cut | CODE `NC` | `GCD` `LCM` `Prime Factors` `DP` `Binary Lifting` `Sieve`   

>  count_occurrences_of_anagrams | CODE `C` | `Sliding-Window` `Map`   

>  the_last_problem | CODE `C` | `Grid` `Series` `Pattern`   

>


  

### `TOPICS`     

> #### ``Stack``

> QUESTIONS | README | CODE

>  --- | --- | ---

>  max_area_histogram |  | CODE

>  max_area_rect_binary_matrix |  | CODE

>  min_element_in_stack |  | CODE

>  next_largest_element |  | CODE  

>  next_smallest_element |  | CODE  

>  rain_water_trapping |  | CODE  

>  stock_span_problem |  | CODE  

> #### ``Heap``

> QUESTIONS | README | CODE

>  --- | --- | ---

>  k_closest_number |  | CODE  

>  k_largest_element |  | CODE  

>  k_smallest_element |  | CODE  

>  sort_k_sorted_array |  | CODE  

>  connect_rope_to_minimize_cost |  | CODE  

> #### ``DP`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  **knapsack** |  |   

>  knapsack |  | CODE  

>  count_number_of_subset_with_given_difference |  | CODE  

>  equal_sum_partition |  | CODE  

>  count_subset_with_given_sum |  | CODE  

>  minimum_subset_sum_diffrence |  | CODE  

>  subset_sum |  | CODE  

>  target_sum |  | CODE  

>  **unbounded_knapsack** |  |   

>  coin_change_1 |  | CODE  

>  coin_change_2 |  | CODE  

>  rod_cutting_problem |  | CODE  

>  **Longest Common Subsequence** | **LIS** |   

>  longest_common_subsequence |  | CODE  

>  longest_common_subtring |  | CODE  

>  longest_palindromic_subsequence |  | CODE  

>  longest_repeating_subsequence |  | CODE  

>  minimum_deletion_to_make_palindrome |  | CODE  

>  minimum_insertion_and_deletion_to_convert |  | CODE  

>  print_longest_common_subsequence |  | CODE  

>  subsequence_pattern_matching |  | CODE  

>  shortest_common_super_sequence |  | CODE  

>  edit_distance |  | CODE  

>  **Matrix Chain Multiplication** | **MCM** |   

>  egg_dropping |  | CODE  

>  evaluate_expression |  | CODE  

>  matrix_chain_multiplication |  | CODE  

>  palindrom_partitioning |  | CODE  

>  scrambeld_string |  | CODE  

>  **DP on Tree** |  |

>  diameter_binary_tree |  | CODE  

>  **Others** | **Mixed** |   

>  fib |  | CODE  

>  LIS |  | CODE  

> #### ``SLIDING_WINDOW`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  **Fixed Size** |  |   

>  count_occurrences_of_anagrams |  | CODE  

>  first_negative_in_window_of_size_k |  | CODE  

>  maximum_sum_subarray_of_size_k |  | CODE  

>  maximum_of_all_subarray_of_size_k |  | CODE  

>  **Variable Size** |  |   

>  count_of_anagram_string |  | CODE  

>  largest_subarray_of_sum_k |  | CODE  

>  largest_subarray_with_k_unique_char |  | CODE  

>  longest_substring_with_no_repeat |  | CODE  

>  minimum_window_substring |  | CODE  

>  pick_toy |  | CODE  

 

> #### ``RECURSION`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  climb_stairs |  | CODE  

>  connected_flowers |  | CODE  

>  delete_middle_element_stack |  | CODE  

>  generate_balanced_parentheses |  | CODE  

>  height_binary_tree |  | CODE  

>  josephus_problem |  | CODE  

>  kth_symbol_grammer |  | CODE  

>  letter_case_permutation |  | CODE  

>  pascals_triangle |  | CODE  

>  permutation_with_case |  | CODE  

>  permutation_with_space |  | CODE  

>  print_n_digit_binary_having_more_ones |  | CODE  

>  print_nums |  | CODE  

>  print_subsets |  | CODE  

>  reverse_stack_using_recursion |  | CODE  

>  reverse_stack_using_recursion |  | CODE  

>  sort_stack |  | CODE  

>  sort_array |  | CODE  

> #### ``GRAPH`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  dfs |  | CODE  

>  bfs |  | CODE  

>  detect_cycle_directed |  | CODE  

>  detect_cycle_undirected |  | CODE  

>  shortest_path_DAG |  | CODE  

>  shortest_path_undirected |  | CODE  

>  topo_sort |  | CODE  

>  weird_connection |  | CODE  

> #### ``LINKED_LIST`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  reverse |  | CODE  

>  detect_loop |  | CODE  

>  find_middle |  | CODE  

>  intersaction |  | CODE  

>  merge_sorted_linkedlist |  | CODE  

>  remove_loop |  | CODE  

>  reverse_in_group |  | CODE  

> #### ``LINKED_LIST`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  reverse |  | CODE  

> #### ``RANDOM`` 

> QUESTIONS | README | CODE

>  --- | --- | ---

>  minimum_swaps_and_K_together | README | CODE  


  

### `CSES` `PROBLEMS`   

> #### ``Introductory ✔``

> QUESTIONS | README | CODE

>  --- | --- | ---

>  Apple Division | README | CODE

>  Bit Strings | README | CODE

>  Chessboard and Queens | README | CODE

>  Coin Piles | README | CODE  

>  Creating String 1 | README | CODE  

>  Grid Path ✖ | README | CODE  

>  Increasing Array | README | CODE  

>  Missing Number | README | CODE  

>  Number Spiral | README | CODE  

>  Palindrome Reorder | README | CODE  

>  Permutations | README | CODE  

>  Repetitions | README | CODE  

>  Trailing Zeros | README | CODE  

>  Two Sets | README | CODE  

>  Weird Algorithm | README | CODE  

> #### ``Sorting and Searching``

> QUESTIONS | README | CODE

>  --- | --- | ---

>  Apartments | README | CODE

>  Concert Tickets | README | CODE

>  Distinct Number | README | CODE

>  Ferris Wheel | README | CODE  

>  Resturent Customers 👁‍🗨 | README | CODE  

>  Max Subarray Sum | README | CODE  

>  Movie Festival | README | CODE  

>  Sum of Two Value | README | CODE  

>  Stick Length | README | CODE  

>  Missing Coin Sum 👁‍🗨 | README | CODE  

> #### ``Mathematics``

> 

> 

> #### ``Dynamic Programming``

> 

> 

> #### ``Graphs``

> 

> 

> #### ``Range Queries``

> 

> 

> #### ``String Algorithms``

> 

> 

> #### ``Additional``

> 

>