Skip to content

This repo contains about(in process) 200 most asked/ popular questions (ranging from easy to hard) in coding test/ interviews

Notifications You must be signed in to change notification settings

shibuk3/Data_Structures_and_Algorithms

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

code_run

This repo contains about(in process) 200 most asked/ popular questions (ranging from easy to hard) in coding test/ interviews.

Cluster 1: Sliding window

Cluster 2: Height/Diameter/ print root to leaf path/print leaf to leaf path/ largest sum path(root to leaf path/leaf to leaf path)

  • Find Maximum Sum path in a binary tree between leaf to leaf node.
  • Print Maximum Sum path in a binary tree between leaf to leaf node.
  • Find Maximum Sum path in a binary tree between root to leaf node.
  • Print Maximum Sum path in a binary tree between root to leaf node.
  • Find Height of binary tree.
  • Find Diameter of binary tree.
  • Find(no. of nodes) longest path in a binary tree from root to leaf
  • Print Diameter path of binary tree/Print the longest path in a binary tree from leaf to leaf.
  • Print the longest path in a binary tree from root to leaf.

Cluster 3: Monotonic Queue

Cluster 4: Binary Search based

Cluster 5: Subset sum(1,2,3)/combination sum(1,2,3,4), permutations(1,2,3)

Cluster 6: Stack based

Cluster 7: Convert binary tree into linked list(preorder/inorder/postorder)

About

This repo contains about(in process) 200 most asked/ popular questions (ranging from easy to hard) in coding test/ interviews

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 91.0%
  • Java 9.0%