Coding Interview Questions | SDE Preparation
HOME
TUTORIALS
EXAMPLES
QUIZ
BLOG
Array
Find duplicate number in array
Sort an array of 0s, 1s, 2s
Repeat and missing number in array
Merge two sorted arrays in C++
Maximum sum subarray | Kadane’s Algo
Merge Intervals
Trees
Inorder, Preorder, Postorder Traversal | Iterative & Recursive
Breadth First Search Tree Traversal
Left View and Right View of a Binary Tree
Top view and Bottom view of Binary Tree
Level order traversal – Spiral form
Height of a Binary Tree
Diameter of a Binary Tree
Check if binary tree is height balanced or not
Check for identical binary trees
Check for subtree in a Binary Tree
Stack
Next Larger Element
Next greater to left
Next smaller element to the right
Next Smaller Element to Left in an array
Tutorials
C Tutorials
C++ Tutorials
Java Tutorials
Python Tutorials
SQL Tutorials
HTML Tutorials
CSS Tutorials
Examples
C Examples
C++ Examples
Java Examples
Python Examples
Online Compilers
C Compiler
C++ Compiler
Java Compiler
Python Compiler
Recent Articles
How to Improve Technical Skills in Programming
Next smaller element to the right
Next Smaller Element to Left in an array
Next greater to left
Next Larger Element
Check for subtree in a Binary Tree
Check for identical binary trees
Check if binary tree is height balanced or not
Diameter of a Binary Tree
Height of a Binary Tree
Level order traversal – Spiral form
Top view and Bottom view of Binary Tree
Left View and Right View of a Binary Tree
Breadth First Search Tree Traversal
Inorder, Preorder, Postorder Traversal | Iterative & Recursive
Merge Intervals
Maximum sum subarray | Kadane’s Algo
Sort an array of 0s, 1s, 2s
Repeat and missing number in array
Find duplicate number in array
Robotics in Manufacturing
Robotics in Medicine
Robotics in Agriculture
Trending Humanoid Robots
Robotics software
Programming a robot using Fingered Gripper, etc
AWS Roadmap and Anomalies
AWS Engineering choices
Cloudtail, IAM and Monitoring (AWS)
Root and Billing information AWS
Suggest/Report Article
SEND
Thank you for your suggestion.
We will look into it.
CopyRight © 2020
CopyRight © 2020