- .gitignore
- README.md
- cpp
- Dynamic Programming
- 01_fibonacci_memoized.cpp
- 02_fibonacci_tabulation.cpp
- 03_count_board_paths_memoization.cpp
- 04_count_board_path_tabulation.cpp
- 05_count_maze_path_memoization.cpp
- 06_count_maze_path_tabulation.cpp
- 07_min_cost_path_memoization.cpp
- 08_min_cost_path_tabulation.cpp
- 09_max_size_square_submatrix_of_all_1s_memoization.cpp
- 10_max_size_square_submatrix_of_all_1s_tabulation.cpp
- 11_goldmine_memoization.cpp
- 12_goldmine_tabulation.cpp
- Generic Tree
- 01_contruct_and_display_gtree.cpp
- 02_size_of_gtree.cpp
- 03_find_a_node.cpp
- 04_max_of_gtree.cpp
- 05_height_of_gtree.cpp
- 06_node_to_root_path.cpp
- 07_lowest_common_ancestor.cpp
- 08_distance_between_two_nodes.cpp
- 09_mirror_of_gtree.cpp
- 10_remove_leaves.cpp
- 11_find_rightmost_leaf.cpp
- 12_pre_order_traversal.cpp
- 13_post_order_traversal.cpp
- 14_linearize.cpp
- Recursion
- 01_print_decreasing.cpp
- 02_print_increasing.cpp
- 03_print_dec_inc.cpp
- 04_print_zz.cpp
- 05_print_zzz.cpp
- 06_tower_of_hanoi.cpp
- 07_factorial.cpp
- 08_x_power_n.cpp
- 09_array_operations_using_recursion.cpp
- 10_all_indices.cpp
- 11_print_pattern.cpp
- 12_binary_search.cpp
- 13_selection_sort.cpp
- 14_get_subsequence.cpp
- 15_get_keypad_combinantions.cpp
- 16_get_stair_path.cpp
- 17_get_maze_path_hv.cpp
- 18_get_maze_path_multimove.cpp
- 19_print_subsequence.cpp
- 20_print_keypad_combinations.cpp
- 21_print_stair_path.cpp
- 22_print_maze_path_hv.cpp
- 23_print_maze_path_multimoves.cpp
- 24_get_possible_alphabetic_combinations.cpp
- 25_print_possible_alphabetic_combinations.cpp
- 26_get_target_sum.cpp
- 27_print_target_sum.cpp
- 28_print_equisets.cpp
- 29_floodfill.cpp
- 30_sudoku.cpp
- 31_n_queens_b_boxes_permute.cpp
- 32_n_queens_b_boxes_combinantions_usingSortedPermutation.cpp
- 33_n_queens_b_boxes_combinations_2power_n.cpp
- 34_get_all_sentences.cpp
- 35_crossword_word_level.cpp
- 36_crossword_box_level.cpp
- 37_magnets.cpp
- 38_coin_change_c.cpp
- 39_n_queenProblem_queen_on_level_permutations.cpp
- 40_n_queenProblem_queen_on_level_combinations.cpp
- Dynamic Programming
- java
- pepcoding-dsa
- src
- arrays
- basics
- AllPrimesTillN.java
- BenjaminBulbs.java
- CountDigitsInANumber.java
- DigitsFrequency.java
- DigitsOfANumber.java
- DigitsOfANumberReverse.java
- Fibonacci.java
- GCDLCM.java
- GradingSystem.java
- HelloWorld.java
- InverseOfANumber.java
- IsPrime.java
- PrimeFactorization.java
- PrintZ.java
- PythagoreanTriplet.java
- RotateANumber.java
- dynamicprogramming
- generictrees
- graphs
- hashmaps
- linkedlist
- numberssystem
- patterns
- priorityqueue
- recursionandbacktracking
- AA_PrintDecreasing.java
- AB_PrintIncreasing.java
- AC_PrintDecreasingIncreasing.java
- AD_Factorial.java
- AE_Power.java
- AF_PrintZigZag.java
- AG_TowerOfHanoi.java
- AH_DisplayArray.java
- AI_DisplayArrReverse.java
- AJ_MaxOfArray.java
- AK_FirstIndexOfOccurance.java
- AL_AllIndicesInAnArray.java
- AM_GetAllSubsequence.java
- AN_GetKeypadCodes.java
- AO_GetStairPath.java
- AP_GetMazePath.java
- AQ_GetMazePathWithJumps.java
- AR_PrintAllSubsequences.java
- AS_PrintKeypadCombinations.java
- AT_PrintStairPath.java
- AU_PrintMazePath.java
- AV_PrintMazePathJumps.java
- AW_PrintAllPermutations.java
- AX_PrintAllEncodings.java
- AY_FloodFill.java
- AZ_TargetSumSubset.java
- BA_NQueens.java
- stacks
- BalancedBrackets.java
- Basics.java
- CelebrityProblem.java
- CustomStack.java
- DuplicateBrackets.java
- DynamicStack.java
- InfixEvaluation.java
- InfixToPrePostFixConversions.java
- LargestAreaHistogram.java
- MergeOverlappingIntervals.java
- MinimumStack.java
- MinimumStackII.java
- NextGreaterElementToRight.java
- NextGreaterElmtToRightApproach2.java
- PostfixEvaluationsAndConversions.java
- PrefixEvaluationsAndConversions.java
- SlidingWindowMaximum.java
- StockSpanProblem.java
- stringstringbuilderandarraylists
- src
- pepcoding-dsa
-
Notifications
You must be signed in to change notification settings - Fork 0
aimanfatima/ds-algo
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|