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
Maximum prefix sum which is equal to suffix sum such that prefix and suffix do not overlap
Given an array arr[] of N Positive integers, the task is to find the largest prefix sum which is also the suffix sum and prefix and suffix do not overlap.Examples:Input: N...
Read More
Arrays
Greedy
two-pointer-algorithm
DSA
Clari5 (CustomerXPs) Recruitment Process
This article will give you information about the company, its recruitment process, sample questions that have been asked previously, lots of experiences shared by other as...
Read More
Interview Experiences
CustomerXPs
Recruitment Process
Experiences
Interview Preparation
Recruitment Process
Can we use Simple Queue instead of Priority queue to implement Dijkstra's Algorithm?
What is Dijkstra's Algorithm?Dijkstra's Algorithm is used for finding the shortest path between any two vertices of a graph. It uses a priority queue for finding the short...
Read More
Queue
priority-queue
Picked
DSA
Arrangements of N and M items of two types when max X and Y items of each can be consecutive
Given 4 numbers N, M, X, Y. which represent N numbers for the first item and M numbers for the second item, the task is to find the number of arrangements of N + M items t...
Read More
Dynamic Programming
Mathematical
DSA
Service | Tech M Quant 5 | Question 10
Three taps A, B and C can fill a tank in 5, 10 and 8 hours respectively. In how many hours threetaps all together can fill the tank ?(A)40/17 hours(B)50/17 hours(C)41/17 h...
Read More
Misc
Service | Tech M Quant 5 | Question 9
A person sold an item at a loss of 10% If the selling price is increased by Rs.216, there would again of 20%. What was the cost price of that item?(A)752(B)720(C)725(D)750...
Read More
Misc
Service | Tech M Quant 5 | Question 8
A person walks some distance and then takes a bus back taking a total time of 50 minutes. Hecould walk both ways in 80 minutes. How long would it take for him to travel by...
Read More
Misc
Service | Tech M Quant 5 | Question 7
162 is divided into four parts is proportional to 3, 4, 5 and 6, then the part that is divisible by 5 is ?(A)60(B)50(C)45(D)55 Answer: (C)Explanation:Let the value of eac...
Read More
Misc
Service | Tech M Quant 5 | Question 4
When we perceive the agreement or disagreement between two events indirectly through aseries of intermediate ideas, what type of reasoning it is called ?(A)Demonstrative(B...
Read More
Misc
Service | Tech M Quant 5 | Question 2
There is a boat whose speed in upstream is 15 m/sec and the speed in downstream is21 m/sec . What is the speed of stream?(A)9 m/sec(B)3 m/sec(C)4 m/sec(D)6 m/sec Answer: ...
Read More
Misc
bi-wizard | 7.0 | Question 15
What will be the output for the following pseudocodeInteger x,ySet x=15,y=9print(x)Label : x+ – –yif(x50)print(x)Goto labelEnd ifprint(y)(A)15,23,30,36,41,45,48,1(B)15,23,...
Read More
Misc
bi-wizard | 7.0 | Question 14
What is the Huffman code for A , C E respectively when the frequency of each character is {A:35,B:88,C:23,D:45,E:56,F:12,G:97,H:66}.(A)\110 11110 101(B)1110 11111 101(C)1...
Read More
Misc
bi-wizard | 7.0 | Question 13
Given unsorted array.Find the sequence of an array that can be built by the lomuto partition after applying only one time.arr={4,15,3,23,4,6,2,5}(A)[4,3,4,2,5,6,23,15](B)[...
Read More
Misc
bi-wizard | 7.0 | Question 12
Consider the following weighted graph Bellman-Ford algorithm is implemented on the given graph with source 0.Find the shortest distance from vertex 0 to 4 using Bellman Fo...
Read More
Misc
bi-wizard | 7.0 | Question 11
Which graph doesn’t give an optimal answer if we use the dijkstra algorithm to find the shortest path to reach the vertex from A to C.(A) (B) (C) (D) Answer: (A) (B)Expl...
Read More
Misc
1
...
3571
3572
3573
...
11195