Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
Fleury's Algorithm for printing Eulerian Path or CircuitGiven an undirected connected graph with v nodes, and e edges, with adjacency list adj. The task is to print an Eulerian trail or circuit using Fleury's AlgorithmA graph i... Read More
Morgan Stanley Interview | Set 1Morgan Stanley campus placement for post IT analyst. 1st round – objective written test10 questions on aptitude and analytics30 questions on programming10 questions on com... Read More
Yahoo Interview | Set 3I would like to express my gratitude towards the GeeksforGeeks team, whose help saw me through to Amazon's interview rounds and getting placed at Yahoo. Number of Rounds: ... Read More
Amazon Interview | Set 361 round (20 MCQ + 2 coding question)3 face to face round, 1 telephonic interview.1st coding question-----------------------------Find the diameter of the tree.2nd coding q... Read More
When Does Compiler Create Default and Copy Constructors in C++?A constructor is a special type of member function of a class that initializes objects of a class. In C++, Constructor is automatically called when an object(instance of a... Read More
Merge Sorted ArraysGiven a 2D matrix, mat[][] consisting of sorted arrays, where each row is sorted in non-decreasing order, find a single sorted array that contains all the elements from th... Read More
Amazon Interview | Set 35On-campus, 1 MCQ round, 2 coding rounds, 4 face-to-face rounds.MCQ round(45 min)- 5 questions on mathematics, one was from probability, all easy 15 questions technical, fr... Read More
Amazon Interview | Set 34First of all, a very very big thanks to whole team of geeks for geeks. It is because of them only that I was able to crack the interview process of amazon and get a job in... Read More
Convex Hull using Graham ScanA convex hull is the smallest convex polygon that contains a given set of points. It is a useful concept in computational geometry and has applications in various fields s... Read More
Stable Marriage ProblemThe Stable Marriage Problem involves pairing N men and N women, each having ranked all members of the opposite sex by preference. The goal is to form marriages where no tw... Read More
Find minimum s-t cut in a flow networkIn a flow network, an s-t cut is a cut that requires the source 's' and the sink 't' to be in different subsets, and it consists of edges going from the source's side to t... Read More
Maximum Bipartite MatchingA matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint. A maximum matching is a matching of maximum size (maximum n... Read More
Convex Hull using Jarvis' Algorithm or WrappingGiven a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.We strongly recommend to see the following... Read More