KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #ai-agents #developer-tools #codex #claude-code #mcp #rust #deepseek-harness #typescript #ai-agent #cli

category-wise-problems

★ 58 Open GitHub ↗

contains category wise problems(data structures, competitive) of popular platforms.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 🏅 Category Wise Problems 🎯

### Approx Questions Count **300**

- Contains category wise organized problems(data structures, competitive) of popular platforms.
- not only solution but also
  - Approaches
  - Corner Cases
  - Special Notes if any
  - Similar Questions if Encountered.

> 🏷️ **Browse by technique:** see the [Tag Index](/TAGS.md) — every problem is
> tagged by pattern (see [tag vocabulary](/CONTRIBUTING.md#tag-vocabulary)).

![Forks](https://img.shields.io/github/forks/mayankdutta/category-wise-problems?style=for-the-badge)
![Stars](https://img.shields.io/github/stars/mayankdutta/category-wise-problems?color=gold&style=for-the-badge)

1. [JMI college placement](#jmi)
2. [adhoc implementation](#adhoc-implementation)
3. [Greedy](#greedy)
4. [Dynamic Programming](#dynamic-programming)
   1. [Fibonacci type](#fibonacci)
   1. [knapsack type](#knapsack)
   1. [Unbounded Knapsack / coin change](#unbounded-knapsack)
   1. [Grid path type](#grid-path)
   1. [LIS type](#lis)
   1. [Prefix Sums / 1D Range sum type / Cumulative sums](#cumulative-sum)
5. [Graphs](#graphs)
   1. [General Graph implementation](#graph-implementation)
   2. [Topological sorting](#topological-sorting)
   3. [Shortest Path](#shortest-path)
   4. [flood fill](#flood-fill)
   5. [DFS](#dfs)
   6. [BFS](#bfs)
   7. [01 BFS](#01-bfs)
   8. [Multi source shortest path](#mssp)
   9. [MST](#mst)
   10. [Tree + dp](#tree-dp)
6. [Number Theory](#number-theory)
7. [Searching and sorting](#searching-and-sorting)
   1. [implementation type](#greedy-implementation)
   2. [sorting and observation type](#sorting-and-observation)
   3. [Binary Search type](#binary-search)
   4. [Sliding Window](#sliding-window)
   5. [Heap type](#searching-and-sorting)
   6. [Intervals type](#intervals-type)
   7. [Divide and Conquer](#divide-conquer)
8. [Data structure](#data-structure)
   1. [Stack](#stack)
   2. [DSU](#dsu)
   3. [Linked List](#linked-list)
   4. [Trees](#trees)
   5. [Binary Search Trees](#bst)
   6. [Trie/Prefix Tree](#trie)
9. [Bitset](#bitset)
10. [Cracking the interview Questions](#cracking-interview)
11. [Notes](/notes)

## Category Wise

### JMI

1. [company data 2020](/JMI_on_campus/List_Of_Companies_2021.md)
1. [company data 2021](/JMI_on_campus/List_Of_Companies_2022.md)
1. [Sapient](/JMI_on_campus/sapient.md)
1. [Delhivery](/JMI_on_campus/delhivery/)
1. [Infoedge](/JMI_on_campus/infoedge/)
1. [JTG\_](/JMI_on_campus/JTG/)
1. [Innovacer](/JMI_on_campus/Innovaccer_off_campus.md)
1. [Optum](/JMI_on_campus/optum.md)
1. [Accenture](/JMI_on_campus/accenture)
1. [Wiley Mthree](/JMI_on_campus/Wiley_mthree)
1. [Mobikwik](/JMI_on_campus/mobikwik/)
1. [Samsung](/JMI_on_campus/samsung/)

### Adhoc implementation

1. [Caesar Cipher](/Atcoder/implementation/caesar_cipher.md)
1. [Polycarp and String Transformation](/Codeforces/implementation/polycarp_and_string_transformation.md)
1. [Vitamins](/Codeforces/implementation/vitamins.md)
1. [Divide and print](/pepcoding/implementation/divide_print.md)
1. [Gas station](/LeetCode/implementation/gas_station.md)
1. [majority element](/LeetCode/implementation/majority_element.md#moore)
1. [majority element 2](/LeetCode/implementation/majority_element2.md#moore)
1. [move zeros](/LeetCode/implementation/move_zeros.md)
1. [sort integers by power](/LeetCode/implementation/sort_integers_power.md)
1. [Kill the Monsters](/Codeforces/implementation/kill_the_monsters.md)
1. [Partition String](/binary_search/implementation/partition_string.md)
1. [valid palindrome II](/LeetCode/implementation/valid_palindrome2.md)
1. [Collision 2](/Atcoder/implementation/collisions2.md)
1. [Moves on Binary Tree](/Atcoder/implementation/moves_binary_tree.md)

### Dynamic Programming

#### Fibonacci

1. [Typical Stairs](/Atcoder/dp/typicalStairs.md)
1. [Boredom](/Codeforces/dp/boredom.md)
1. [Constanze's Machine](/Codeforces/dp/Constanze_Machine.md)
1. [Basketball](Codeforces/dp/basketball.md)
1. [Domino and Tromino Tiling](/LeetCode/dp/domino.md)
1. [House robber](/LeetCode/dp/house_robber.md)
1. [Delete and earn](/LeetCode/dp/delete_and_earn.md)
1. [Min Cost Climbing Stairs](/LeetCode/dp/min_cost_climbing.md)
1. [Arithmetic Slices](/LeetCode/dp/arithmetic_slices.md#dp)
1. [Unique BST](/LeetCode/bst/unique_bst.md#dp)
1. [Number of people aware of secrets](/LeetCode/dp/number_people_aware.md)

#### Knapsack

1. [Two Sets 2](/CSES/dp/two_sets2.md)
1. [Book Shop](/CSES/dp/book_shop.md)
1. [money sums](/CSES/dp/money_sums.md)
1. [dividing coins](/uva/dp/dividing_coins.md)
1. [divisible group sums](/uva/dp/divisible_group_sums.md)
1. [wedding shopping](/uva/dp/wedding_shopping.md)
1. [sum of different Primes](/uva/dp/sum_of_different_primes.md)
1. [hoof paper scissor](/USACO/dp/hoof_paper_scissor.md)
1. [maximum score from performing multiplication operations](/LeetCode/dp/max_score_performing_multiple.md)
1. [Divide the array in K segments such that the sum of minimums is maximized](/GeeksForGeeks/dp/divide_array_k_subsegements.md)
1. [Best Time to Buy and Sell Stock IV](/LeetCode/dp/best_time_to_buy_sell_stock4.md)
1. [Best Time to Buy and Sell Stock with Cooldown](/LeetCode/dp/best_time_to_buy_sell_cooldown.md)
1. [Best Time to Buy and Sell Stock with Transaction Fee](/LeetCode/dp/best_time_to_buy_sell_fee.md)
1. [Longest Palindromic Subsequence](/LeetCode/dp/longest_palindromic_subseq.md)
1. [Last Stone Weight II](/LeetCode/dp/last_stone_weight2.md)

#### Unbounded Knapsack

1. [Coin change](/LeetCode/dp/coin_change.md)
1. [Coin change 2](/LeetCode/dp/coin_change2.md)
1. [Knapsack with duplicate Items](/GeeksForGeeks/dp/knapsack_with_duplicate.md)
1. [Removing Digits](/CSES/dp/removing_digits.md)
1. [Minimizing coins](/LeetCode/dp/minimizing_coins.md)
1. [Combination sum 4](/LeetCode/dp/combination_sum4.md)
1. [Dollars](/uva/dp/dollars.md)
1. [Fruit Feast](/USACO/dp/fruit_feast.md)
1. [Minimum Difficulty of a Job Schedule](/LeetCode/dp/min_difficulty_job_schedule.md)
1. [Number of Dice Rolls With Target Sum](/LeetCode/dp/dice_rolls_target_sum.md)
1. [Decode Ways](/LeetCode/dp/decode_ways.md)

#### Grid path

1. [edit distance](/CSES/dp/edit_distance.md)
1. [grid paths](/CSES/dp/grid_paths.md)
1. [LCS](/LeetCode/dp/lcs.md)
1. [Maximal square](/LeetCode/dp/maximal_square.md)
1. [Unique Paths](/LeetCode/dp/unique_paths.md#unique-paths-1)
1. [Unique Paths 2](/LeetCode/dp/unique_paths.md#unique-paths-2)
1. [Minimum Path sum](/LeetCode/dp/min_path_sum.md)
1. [Minimum Falling Path Sum](/LeetCode/dp/min_falling_path_sum.md)
1. [Maximum Length of Repeated Subarray](/LeetCode/dp/max_subarray_two_array.md)
1. [Champagne Tower](/LeetCode/dp/champagne_tower.md)

#### LIS

1. [what goes up](/uva/dp/what_goes_up.md)
2. [Kth increasing](/LeetCode/lis/k_increasing.md)
3. [Word Break](/LeetCode/dp/word_break.md)

#### Cumulative sum

1. [Maximum Absolute Sum of Any Subarray](/LeetCode/dp/max_abs_sum.md)
1. [Maximum Product Subarray](/LeetCode/dp/max_product_subarray.md)
1. [Maximum Sum Circular Subarray](/LeetCode/prefix/max_sum_circular_subarray.md)
1. [Number of Smooth Descent Periods of a Stock](/LeetCode/dp/smooth_descent.md)
1. [Blackboard GCD](/Atcoder/prefix/blackboard_gcd.md)
1. [Make Power of 2](/Codeforces/prefix/make_power_of_two.md)
1. [Subsequence Summing to 7](/USACO/prefix_sums/subs_summing_to_sevens.md)
1. [Good Days to Rob the Bank](/LeetCode/prefix/good_days_rob_bank.md)
1. [And it's non-zero](/Codeforces/prefix/and_its_nonzero.md)
1. [Contiguous array](/LeetCode/prefix/contiguous_array.md)
1. [Tsundoku](/Atcoder/prefix/tsundoku.md)
1. [Intervals Between Identical Elements](/LeetCode/prefix/intervals_identical_elements.md)
1. [Maximum Sum of Two Non-Overlapping Subarrays](/LeetCode/prefix/subarrays_odd_sum.md)
1. [Reducing dishes](/LeetCode/dp/reducing_dishes.md)
1. [Best time to Buy and sell stocks](/LeetCode/prefix/best_time_to_buy_sell_stock.md#prefix-sums)
1. [Make Sum Divisible by P](/LeetCode/prefix/make_sum_divisible.md)
1. [Arithmetic Slices](/LeetCode/dp/arithmetic_slices.md#dp-with-state-compression)
1. [Count of Subarrays having sum equal to its length](/GeeksForGeeks/prefix/subarrays_sum_equals_length.md)
1. [Number of Subarrays having absolute sum greater than K](/GeeksForGeeks/prefix/subarrays_sum_greater.md)
1. [Trapping Rain water](/LeetCode/prefix/trapping_water.md)
1. [Largest Sum Subarray of Size at least K](/GeeksForGeeks/dp/largest_sum_subarray_size_k.md)

#### TODO

1. [AAB](/Atcoder/dp/aab.md)
2. [Cooking](/Atcoder/dp/cooking.md)
3. [FG operation](/Atcoder/dp/fg_operation.md)
4. [Shipping Center](/Atcoder/dp/shipping_center.md)
5. [Strange Lunchbox](/Atcoder/dp/strange_lunchbox.md)

### Graphs

#### Graph implementation

1. [Detonate the maximum bombs](/LeetCode/graph/detonate_maximum_bomb.md)
1. [Replace the numbers](/Codeforces/graphs/replace_the_numbers.md)
1. [Moo Cast](/USACO/graph/moocast.md)

#### Topological Sorting

1. [Course schedule](/CSES/graphs/course_schedule.md)
1. [Game routes](/CSES/graphs/game_routes.md)
1. [Longest flight route](/CSES/graphs/longest_flight_route.md)
1. [Parallel course 3](/LeetCode/graph/parallel_courses_3.md)
1. [Restricted permutation](/Atcoder/graph/Restricted_Permutation.md)
1. [Longest Path](/Atcoder/dp_series.md)
1. [Gardner and trees](/Codeforces/graphs/gardner_and_tree.md)
1. [Minimum height tree](/LeetCode/graph/minimum_height_tree.md)
1. [Find All Possible Recipes from Given Supplies](/LeetCode/graph/recipes_supplies.md)

#### Shortest path

1. [Flight discount](/CSES/graphs/flight_discount.md)
1. [Investigation](/CSES/graphs/investigation.md)
1. [Djikstra](/Codeforces/graphs/djikstra.md)
1. [Network delay time](/LeetCode/graph/network_delay_time.md)
1. [Puzzle on Graph](/Atcoder/graph/8-Puzzle-on-Graph.md)
1. [Swim in the rising water](LeetCode/graph/swim_in_rising_water.md#shortest-path)

#### Flood fill

1. [Making a Large Island](/LeetCode/graph/making_a_large_island.md)
2. [Number of islands](/LeetCode/graph/number_of_islands.md)
3. [Number of Distinct Islands](./GeeksForGeeks/grid/number_of_distinct_island.md)

#### DFS

1. [Round Trip](/CSES/graphs/round_trip.md)
2. [Kings Path](/Codeforces/graphs/kings_path.md)
3. [Neighbours](/Atcoder/graph/neighbours.md)
4. [Keys and Rooms](/LeetCode/graph/keys_and_rooms.md#dfs)

#### BFS

1. [Graph Girth](/CSES/graphs/graph_girth.md)
2. [Word Ladder](/LeetCode/graph/word_ladder.md)
3. [Making a large island](/LeetCode/dsu/making_large_island.md#bfs)
4. [Swim in the Rising Water](LeetCode/graph/swim_in_rising_water.md#binary-search-on-the-answer)
5. [Multiply and Rotate](/Atcoder/graph/multiply_rotate.md)
6. [Keys and Rooms](/LeetCode/graph/keys_and_rooms.md#bfs)

#### 01 BFS

1. [Wizard in maze](/Atcoder/graph/wizard_in_maze.md)

#### MSSP

1. [01 Matrix](/LeetCode/graph/01matrix.md)
2. [Shortest distance to a character](/LeetCode/graph/shortest_distance_character.md#multisource-bfs)

#### MST

1. [3-types](/hackerearth/README.md)
2. [Minimum Cost to Connect Path](/LeetCode/graph/min_cost_to_connect_path.md)

#### Tree Dp

1. [Number of Nodes in the Sub-Tree With the Same Label](/LeetCode/trees/nodes_subtree_same_label.md)

### Number theory

1. [Amusement park](/Atcoder/maths_greedy/amusement_park.md)
1. [Divisor counts](/Codeforces/number_theory/divisor_count.md)
1. [Pairs of Songs With Total Durations Divisible by 60](/LeetCode/number_theory/pairs_divisible_by_60.md)
1. [Max GCD Pair](/codestudio/number_theory/max_gcd_pair.md)
1. [Make it Equal](/LeetCode/number_theory/smallest_integer_divisibe_k.md)
1. [Count Nice Pairs in an Array](/LeetCode/number_theory/nice_pairs.md)
1. [Robbery](/pepcoding/number_theory/robbery.md)
1. [Max GCD 2](/Atcoder/number_theory/max_gcd2.md)
1. [Multiple length](/codestudio/number_theory/multiple_length.md)

### Searching and sorting

#### greedy implementation

1. [Shortest distance to a character](/LeetCode/graph/shortest_distance_character.md#searching-sorting)
1. [Construct Smallest Number From DI String](/LeetCode/greedy/construct_DI_smallest.md)
1. [DI String Match](/LeetCode/greedy/DI_string_match.md)
1. [Shortest Subarray to be Removed to Make Array Sorted](/LeetCode/greedy/shortest_subarray_remove.md)
1. [Best time to sell the stock](/LeetCode/dp/best_time_to_sell_stock.md)

#### sorting and observation

1. [Linear approximation](/Atcoder/searching_sorting/linear_approx.md)
2. [LR Insertion](/Atcoder/linkedList/LR_insertion.md#list-implementation)

#### Binary search

1. [Binary Search](/LeetCode/binary_search/binary_search.md)
1. [Binary search in sorted rotated array](/LeetCode/binary_search/search_sorted_rotated.md)
1. [Apartments](/CSES/searching_and_sorting/apartments.md)
1. [Subarray sums 2](/CSES/searching_and_sorting/subarray_sums_2.md)
1. [Binary search in sorted array](/LeetCode/binary_search/binary_search_in_sorted_array.md)
1. [Koko eating bananas](LeetCode/binary_search/koko_eating_bananas.md)
1. [swim in the rising water](LeetCode/graph/swim_in_rising_water.md#binary-search-on-the-answer)
1. [count the words after adding a letter](/LeetCode/binary_search/count_words_after_adding_letter.md#binary-search)

#### Sliding Window

1. [Contains Duplicate II](/LeetCode/2p/contains_duplicate.md#contains-duplicate-2)
1. [maximum consecutive one's](/LeetCode/2p/maxConsecutiveOne.md)
1. [Minimum Operations to Reduce X to Zero](/LeetCode/2p/min_operation_x_to_zero.md)
1. [Longest X](/Atcoder/2p/longestX.md)
1. [Subarrays with k different Integers](/LeetCode/2p/subarrays_with_k_different_integers.md)
1. [Number of Substrings Containing All Three Characters](/LeetCode/2p/containing_all_three.md)
1. [Binary Subarrays with sum](/LeetCode/2p/binary_subarray_with_sum.md)
1. [Minimum Swaps to Group All 1's Together II](/LeetCode/2p/min_swaps.md)
1. [Find All Anagrams in a String](/LeetCode/2p/find_all_anagrams.md)
1. [Permutation in String](/LeetCode/2p/permutation_in_string.md)
1. [Total Appeal of A String](/LeetCode/2p/total_appeal_string.md)
1. [Count Unique Characters of All Substrings of a Given String](/LeetCode/2p/count_unique_character.md)
1. [Sliding window Maximum](/LeetCode/2p/sliding_window_maximum.md)
1. [Geekland colosseum](/GeeksForGeeks/prefix/geekland_colosseum.md)
1. [Maximum sum of two non-overlapping subarrays of a given size](/codestudio/prefix/max_sum_non_overlapping_subarray.md)
1. [Largest Sum Subarray of Size at least K](/GeeksForGeeks/dp/largest_sum_subarray_size_k.md)
1. [Maximum Number of Robots Within Budget](./LeetCode/2p/max_numbers_budget.md)

#### Intervals type

1. [Non Overlapping Subintervals](/LeetCode/greedy/non_overlapping_intervals.md)
1. [Merge intervals](/LeetCode/greedy/merge_intervals.md)
1. [Car pooling](/LeetCode/greedy/car_pooling.md)
1. [Permutation in String](/LeetCode/greedy/min_arrows_burst_balloons.md)
1. [My Calendar I](/LeetCode/greedy/my_calendar1.md)

#### Heaps

1. [Top k frequent words](/LeetCode/heaps/top_k_words.md)
1. [Kth Largest Element in an Array](/LeetCode/heaps/kth_largest_element.md)
1. [Top K Frequent Elements](/LeetCode/heaps/top_k_elements.md)
1. [Last Stone Weight](/LeetCode/heaps/last_stone_weight.md)
1. [K Closest Points to Origin](/LeetCode/heaps/k_closest_point.md)
1. [Furthest Building You Can Reach](/LeetCode/heaps/furthest_point_reachable.md)
1. [Geekland colosseum](/GeeksForGeeks/prefix/geekland_colosseum.md)
1. [Potions](/Codeforces/greedy/potions.md)
1. [Minimum Number of Refueling Stops](/LeetCode/heaps/min_number_refueling_stops.md)
1. [Find Median from Data Stream](/LeetCode/heaps/find_median_data_stream.md), todo

#### Divide Conquer

1. [Thanos sort](/Codeforces/divide_and_conquer/thanos_sort.md)
2. [Number of Pairs Satisfying Inequality](./LeetCode/dc/count_greater_right.md#merge-sort-method)

### Data structure

#### Stack

1. [Longest valid paranthesis](/LeetCode/stack/longest_valid_paranthesis.md)
1. [Asteroid Collision](/LeetCode/stack/asteroid_collission.md)
1. [Sliding window Maximum](/LeetCode/2p/sliding_window_maximum.md#monotonic-deque)
1. [132 Pattern](/LeetCode/stack/132_pattern.md)
1. [largest area histogram](/LeetCode/stack/largest_area_histogram.md)
1. [Next greater element](/LeetCode/stack/next_greater_element.md)
1. [Remove duplicate letters](/LeetCode/stack/remove_duplicate_letters.md)
1. [Remove K digits](/LeetCode/stack/remove_k_digits.md)
1. [First negative integer in every window of size k](/GeeksForGeeks/stack/negative_in_window.md)

#### DSU

1. [Little Alawn's Puzzle](/Codeforces/dsu/little_alwan_puzzle.md)
2. [Graph destruction](/Atcoder/dsu/graphDestruction.md)
3. [Accounts Merge](/LeetCode/dsu/accounts_merge.md)
4. [Neighbours](/Atcoder/graph/neighbours.md)
5. [Largest Component Size by Common Factor](/LeetCode/dsu/largest_component_common_factor.md)
6. [Making a large island](/LeetCode/dsu/making_large_island.md#dsu)
7. [Most Stones Removed with Same Row or Column](/LeetCode/graph/remove_stones_same_row_col.md)
8. [smallest string with swaps](/LeetCode/dsu/smallest_string_with_swap.md)

#### Linked List

1. [Add two numbers](/LeetCode/linkedList/add_two_numbers.md)
1. [Delete node in linked list](/LeetCode/linkedList/delete_node_in_linked_list.md)
1. [Intersection of two linked list](/LeetCode/linkedList/intersection_of_two_LL.md)
1. [Linked list cycle](/LeetCode/linkedList/LLcycle.md)
1. [Middle of the linked list](/LeetCode/linkedList/middle_of_the_linked_list.md)
1. [Reverse linked list](/LeetCode/linkedList/reverse_ll.md)
1. [Odd Even Linked List](/LeetCode/linkedList/odd_even_linkedlist.md)
1. [Palindrome linked list](/LeetCode/linkedList/palindrome.md)
1. [Merge two sorted arrays](/LeetCode/linkedList/merge_two_sorted_list.md)
1. [Sort List](https://leetcode.com/problems/sort-list/)
1. [Merge k sorted list](/LeetCode/linkedList/merge_k_sorted_list.md)
1. [LR Insertion](/Atcoder/linkedList/LR_insertion.md#doubly-linked-list-implementation)
1. [Copy List with Random Pointer](/LeetCode/linkedList/copy_ll_random.md)
1. [LRU cache](/LeetCode/linkedList/LRU.md)
1. [Delete the Middle Node of a Linked List](./LeetCode/linkedList/delete_middle.md)

#### Trees

1. [Pre-order Traversal](/LeetCode/trees/preorder.md)
1. [In-order Traversal](/LeetCode/trees/inorder.md)
1. [Post-order Traversal](/LeetCode/trees/postorder.md)
1. [Level order](/LeetCode/trees/levelorder.md)
1. [Left view](/GeeksForGeeks/trees/leftview.md)
1. [Right view](/GeeksForGeeks/trees/rightview.md)
1. [Top view](/GeeksForGeeks/trees/topview.md)
1. [Bottom view](/GeeksForGeeks/trees/bottomview.md)
1. [Depth of binary tree](/LeetCode/trees/depth_of_binarytree.md)
1. [Balanced binary tree](/LeetCode/trees/balanced_binarytree.md)
1. [Same Tree](/LeetCode/trees/same_tree.md)
1. [diameter of the binary tree](/LeetCode/trees/diameter_of_tree.md)
1. [binary tree tilt](/LeetCode/trees/binary_tree_tilt.md)
1. [Populating Next Right Pointers in Each Node](/LeetCode/trees/populate_next_right.md)
1. [Lowest common ancestor](/LeetCode/trees/lowest_common_ancestor.md)
1. [Maximum difference between node and ancestor](/LeetCode/trees/maximum_diff_node_ancestor.md)
1. [vertical order traversal](/LeetCode/trees/vertical_order_traversal.md)
1. [Binary Tree Zigzag Level Order Traversal](/LeetCode/trees/zig_zag.md)
1. [Symmetric Tree](/LeetCode/trees/symmetric_tree.md)
1. [Maximum Width of Binary Tree](/LeetCode/trees/max_width.md)
1. [Count Complete Tree Nodes](/LeetCode/trees/node_complete_binary_tree.md)
1. [Create Binary Tree From Descriptions](/LeetCode/trees/create_binary_tree_from_description.md)
1. [Duplicate Subtree](/LeetCode/trees/duplicate_subtree.md)
1. [Delete leaves with given value](/LeetCode/trees/delete_leaves_with_given_value.md)
1. [Binary Tree Pruning](/LeetCode/trees/binary_tree_pruning.md)
1. [Distance b/w two nodes](/codestudio/trees/distance_two_nodes.md)
1. [All distance at k in Binary tree](/LeetCode/trees/all_nodes_distance_k.md)
1. [Max Depth N ary tree](/LeetCode/trees/max_depth_n_ary_tree.md)
1. [Binary Tree to mirror tree](/codestudio/trees/binary_tree_mirror_tree.md)
1. [Morris In order](/LeetCode/trees/morris_inorder.md)
1. [Morris Pre order](/LeetCode/trees/morris_preorder.md)
1. [Binary Tree to DLL](/GeeksForGeeks/trees/bt_to_dll.md)

#### BST

1. [insert into binary search tree](/LeetCode/bst/insert_into_bst.md)
1. [Validate Binary Search Tree](/LeetCode/bst/validate_bst.md)
1. [Convert Sorted Array to Binary Search Tree](/LeetCode/bst/array_to_bst.md)
1. [Minimum Distance Between BST Nodes](/LeetCode/bst/min_distance_nodes.md)
1. [Delete node in BST](/LeetCode/bst/delete_node.md)
1. [Unique BST](/LeetCode/bst/unique_bst.md#catalan-number)
1. [Serialize and Deserialize Binary Tree](/LeetCode/bst/serialize_deserialize.md)
1. [BST to greater sum tree](/LeetCode/bst/BST_greater_sum_tree.md)
1. [Minimum absolute difference](/LeetCode/bst/min_absolute_diff.md)

#### Trie

1. [Implement Trie (Prefix Tree)](/LeetCode/trie/implementing_trie.md)
2. [Design Add and Search Words Data Structure](/LeetCode/trie/design_dictionary.md)

### Bitset

1. [complement of base 10](/LeetCode/bitset/complement_of_base10.md)
1. [Hammering distance](/LeetCode/bitset/hammeringDistance.md)
1. [Number of valid words for each puzzle](/LeetCode/bitset/NumberOfValidWordsForEachPuzzle.md)
1. [Total hammering distance](/LeetCode/bitset/totalHammeringDistance.md)
1. [and it's non-zero](/Codeforces/prefix/and_its_nonzero.md)
1. [Make it equal](/codestudio/bits/make_it_equal.md)
1. [count the words after adding a letter](/LeetCode/binary_search/count_words_after_adding_letter.md#bit-manipulation)
1. [majority element](/LeetCode/implementation/majority_element.md#bits)
1. [Find XOR Sum of All Pairs Bitwise AND](/LeetCode/bitset/xor_sum_all_pairs_biwise_and.md)

### Cracking Interview

1. [Is unique](./CrackingTheCodingInterview/Array/1.%20Is_unique/README.md)
2. [Check Permutation](./CrackingTheCodingInterview/Array/2.%20Check_permutation/README.md)

## 💥How to Contribute?

Head over to [Contributing Guidelines](/CONTRIBUTING.md) to know more!

## Stargazers over time

[![Stargazers over time](https://starchart.cc/mayankdutta/category-wise-problems.svg)](https://starchart.cc/mayankdutta/category-wise-problems)

category-wise-problems

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README