chef-supreme / category-wise-problems

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

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

Tags

• JMI college placement
• Greedy
• 2 Pointers
• Prefix Sums
• Dynamic Programming
  • knapsack type
  • Coin Change type
  • Grid path type
  • LIS type
  • Fibonacci type
  • 1D Range sum type
• Graphs
  • Topological sorting
  • Shortest Path
  • flood fill
  • DFS
  • BFS
  • 01 BFS
  • MSSP
  • MST
• Number Theory
• Searching and sorting
  • Binary Search type
  • Two pointers
• Data structure
  • Stack
  • DSU
  • Linked List
  • Trees
• Bitset
• Adhoc, observation type

JMI

• company data 2020
• company data 2021
• Sapient
• Delhivery
• Infoedge
• JTG_
• Innovacer
• Optum
• Accenture
• Wiley Mthree

Greedy

• Best time to sell the stock

Prefix Sum / Cumulative sum.

• blackboard-gcd
• make_power_of_2
• Subsequence summing to 7

Dynamic Programming.

Fibonacci-type

• typical stairs
• boredom
• C. Constanze's Machine
• Basketball
• domino and tromino tiling

Knapsack type

• two_sets2
• book_shop
• money_sums
• dividing_coins
• divisible_group_sums
• wedding_shopping
• sum_of_different_primes
• hoof_paper_scissor

Coin change type

• removing_digits
• dollars
• fruit_feast

Grid path types

• edit_distance
• grid_paths
• LCS

LIS type

• what_goes_up

1D Range sum

• maximum product subarray

TODO

• aab
• cooking
• fg_opeartion
• shipping_center
• strange_lunchbox

Graphs

Topological Sorting

• course_schedule
• game_routes
• longest_flight_route
• Parallel course 3
• Restricted permutation
• G - Longest Path

Shortest path

• flight_discount
• investigation
• djikstra
• network_delay_time
• 8 puzzle on graph

Flood fill

• making_a_large_island

DFS

• round_trip
• Kings Path

BFS

• graph_girth
• word_ladder

01 BFS

• Wizard in maze

MSSP

• 01 Matrix

MST

• 3-types

Number theory

• Amusement park

Searching and sorting

Binary search type

• Apartments
• Subarray sums 2
• binary search in sorted array
• Koko eating bananas

Two Pointers

• maximum consecutive one's
• Longest X
• Subarrays with k different Integers
• Number of Substrings Containing All Three Characters
• binary subarrays with sum

Data structure

Stack

• Longest valid paranthesis

DSU

• Little Alawn's Puzzle
• Graph destruction
• Accounts Merge

Linked-list

• add two numbers
• delete node in linked list
• intersection of two linked list
• linked list cycle
• middle of the linked list
• reverse linked list
• Odd Even Linked List

Trees

• Preorder Traversal
• Inorder Traversal
• Postorder Traversal
• Level order
• left view
• right view
• top view
• bottom view
• Depth of binary tree
• Balanced binary tree
• Same Tree
• diameter of the binary tree
• binary tree tilt
• Lowest common ancestor

bitset

• complement of base 10
• Hammering distance
• Number of valid words for each puzzle
• Total hammering distance

Adhoc, observation type

• Polycarp and String Transformation

Please follow these rules, if you wish to CONTRIBUTE.

Current repo Structure.

ROOT
  |
  Platform_1
  |
  |___ Topic/Tag
  .      |____ problem_name/README.md
  .      |____ problem_name/README.md
  .      |____ problem_name/README.md
  .
  .
  |     
  Platform_2
  |
  |___ Topic/Tag
         |____ problem_name/README.md

Structure of ProblemList.md

Topic on which problem is base (preferrably h2, h3 heading)

Problem name, Easy / medium / hard (according to you)

- What makes it Easy/medium/hard according to you.
    |_____ point 1 
    |_____ point 2
    
- some key points, was there some different approach then regular?
    |_____ point 1
    |_____ point 2
    
- Appraoch (should be insightfull)
    
- corner cases, if you faced any
    |_____ point 1
    |_____ point 2
    
- code(it is advisable to copy RAW of similar problem on this repo, to save time)

- Similar problem if you encounter any.

Some Templates you may inspire from

• Normal template
• dynamic programming type, if you wish to add more then 1 approach. this one too
• Grapn type

to save time you can copy the template by viewing RAW file and fit in your content.