Courses
Tutorials
Jobs
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
Trending Now
DSA
Web Tech
Foundational Courses
Data Science
Practice Problem
Python
Machine Learning
JavaScript
System Design
Django
DevOps Tutorial
Java
C
C++
ReactJS
NodeJS
CP Live
Aptitude
Puzzles
Projects
GBlog
Three 90 Challenge: Bigger and Better
As we transit into the new phase, it's essential to fuel our inner drive for success. On popular demand, GeeksforGeeks is happy to announce that we are back with the Thre...
Read More
Nishant | quiz 1.0 | Question 4
Which of the following points is/are true about Linked List data structure when it is compared with array? (A)Arrays have better cache locality that...
Read More
ankit | quiz | Question 8
The problem related to subset-sum is defined as follows. A set consisting of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and a positive integer W is given. Is ...
Read More
ankit | quiz | Question 7
You are given a matrix of dimensions 'm x n' containing non-negative integers. Your goal is to find the number of unique paths from the top-left corner to the ...
Read More
ankit | quiz | Question 2
Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of n...
Read More
ankit | quiz | Question 1
Which of the following is true about Binary Trees? (A)Every binary tree is either complete or full.(B)Every complete binary tree is also a full bina...
Read More
KL | University | Question 2
Given below is a statement about unordered_set. Choose the correct alternative for the statement.Keys in unordered_set does not maintain an order (A...
Read More
KL | University | Question 1
In a binary tree, a node may have 0, 1, or 2 children. In the following questions about binary trees, the height of a tree is the length (number of edges) of t...
Read More
Nishant | quiz 2.0 | Question 8
What are the applications of tree data structure?1. Manipulate hierarchical data2. Make information easy to search 3. Manipulate sorted lists of data4. Router ...
Read More
Nishant | quiz 2.0 | Question 2
What are the appropriate data structures for following algorithms?1) Breadth-First Search 2) Depth First Search 3) Prim\'s Minimum Spa...
Read More
Nishant | quiz 1.0 | Question 9
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are ...
Read More
Nishant | quiz 1.0 | Question 3
What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search? (A)N(B)N*log(N...
Read More
Nishant | quiz 1.0 | Question 2
Suppose we have an O(n) time algorithm that finds the median of an unsorted array. Now consider a QuickSort implementation where we first find the median using...
Read More
Nishant | quiz 1.0 | Question 1
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A)Θ(n)(B)Θ(log...
Read More
ankit | quiz | Question 10
A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What woul...
Read More
ankit | quiz | Question 3
In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tre...
Read More
1
...
1652
1653
1654
...
11204