Algorithms-and-Data-Structures
/
20-Coding-Patterns-DesignGurus.org
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
30 Commits
1 Branch
0 Tags
43 KiB
C++ 96.2%
CMake 3.8%
 
 
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '9fa13e7447'
${ noResults }
Go to file
Manish 9fa13e7447 Design Pattern 12: Modified Binary Search | Problem: Bitonic Point 1 year ago
.vscode debugger configuration 1 year ago
.gitignore
…
1_longest_substring_with_k_distinct_characters.cpp
…
1_longest_substring_with_k_distinct_characters_test_cases.csv
…
2_num_of_islands.cpp
…
3_squares_of_a_sorted_array.cpp
…
5_conflicting_appointments.cpp
…
6_find_all_missing_numbers.cpp
…
7_reverse_nodes_in_k_group.cpp
…
8_binary_tree_level_order_traversal.cpp
…
9_path_sum_iii.cpp Design Pattern 9: DFS | Problem: Path Sum III 1 year ago
10_find_the_median_of_a_number_stream.cpp Design Pattern 10: Two Heaps: Problem: Find Median from Data Stream 1 year ago
11_letter_case_permutation.cpp Design Patter 11: Subsets | Problem: Letter Case Permutations 1 year ago
11_permutations_in_string.cpp Design Pattern 11 | Problem: Permutation in String 1 year ago
12_bitonic_point.cpp Design Pattern 12: Modified Binary Search | Problem: Bitonic Point 1 year ago
CMakeLists.txt Design Pattern 12: Modified Binary Search | Problem: Bitonic Point 1 year ago
LICENSE
…
README.md
…
lib_leetcode.h Design Patter 11: Subsets | Problem: Letter Case Permutations 1 year ago
lib_random.h
…

README.md
Unescape Escape

20 Coding Patterns by DesignGurus.org

20 DSA Coding Patterns from https://levelup.gitconnected.com/dont-just-leetcode-follow-the-coding-patterns-instead-4beb6a197fdb

Coding Patterns:

  1. Sliding Window
  2. Islands (Matrix Traversal)
  3. Two Pointers
  4. Fast & Slow Pointers
  5. Merge Intervals
  6. Cyclic Sort
  7. In-place Reversal of a LinkedList
  8. Tree Breadth-First Search
  9. Tree Depth First Search
  10. Two Heaps
  11. Subsets
  12. Modified Binary Search
  13. Bitwise XOR
  14. Top ‘K’ Elements
  15. K-way Merge
  16. Topological Sort
  17. 0/1 Knapsack
  18. Fibonacci Numbers
  19. Palindromic Subsequence
  20. Longest Common Substring