Skip to content
Gblog Algo Geek – DSA Article Writing Contest By GeeksforGeeks
 A Contest of Writing DSA Based Articles…!! This single line must have created various queries in the minds of all the tech enthusiasts. And why… Read More
There are two drums of vanaspati gee. One of them contains 25% of oil (and rest 75% gee) and the another contains 50% oil (and… Read More
A sikanji vendor has two drums of sikanji. The first contains 75% of sikanji. The second contains 50% sikanji. How much sikanji should he mix… Read More
A drum contains forty liters of whisky. Four liters of whisky is taken out and replaced by soda. This process is carried out twice further.… Read More
Ram and Shyam’s ages are in the ratio between 4:3. After 6 Years age of Ram will be 26 years. What is present age of… Read More
The ages of A and B differ by 16 years. 6 years ago, the elder one was 3 times as old as the younger one.… Read More
The Sum of ages of Seeta and Geeta is 12 years less than the sum of ages of Geeta and Ina. By how many years… Read More
Ram age was half of Shaym’s age, 10 years ago. If the ratio of their present ages is 3:5, what is the sum of their… Read More
The sum of the ages of a mother and daughter is 45 years. 5 years ago, the product of their ages was 30 times the… Read More
The sum of the ages of a mother and daughter is 45 years. 5 years ago, the product of their ages was 30 times the… Read More
If difference of ages of Ram and Shyam is 16 years. If 6 year ago, the Ram’s age is 3 times as old the Shyam,… Read More
The present ages of Ram and Shyam are in the ratio 6:7. If Shyam is 4 years older than Ram, after 4 years what will… Read More
A boy is older than girl by 7 years. If the ratio of ages of boy:girl is 9:7, what is the age of boy? (A)… Read More
Meena will be 5 times his age 5 years back, after 15 years. What is the present age of Meena? (A) 10 years (B) 15… Read More
A Cartesian tree is a tree data structure created from a set of data that obeys the  following structural invariants:  The tree obeys in the min (or max) heap property – each node is less (or greater) than its children. An inorder traversal of the nodes yields the values in the same order in which they appear in the initial sequence. Suppose we have an input array- {5,10,40,30,28}. Then the max-heap Cartesian Tree would be. Attention reader! Don’t stop… Read More

Start Your Coding Journey Now!