DBOI Interview Questions  

See also
Top 45 Ruby interview questions for 2021
Please click Like if you loved this article?

Tree Questions DBOI

Question 1. Binary Search Tree Search and Insertion Problem Statement   Write an algorithm to perform searching and insertion in Binary Search Tree. So what we are going to do is insert some of the elements from input into a binary search tree. Whenever asked to search a particular element, we’ll be searching it among the elements in BST(short ...

Read more

Question 2. Binary Search Tree A binary search tree is a Binary tree with some rules that allows us to maintain the data in a sorted fashion. As it is a binary tree hence, a node can have at max 2 children. Structure of a Binary Search Tree node     Rules for Binary tree to ...

Read more

Question 3. Binary Tree Data Structure In this article, we will read about the Binary Tree Data Structure. Trees are hierarchical data structures where every node has a parent node except the root node. The nodes with no child are called leaves. Need for Trees?   1. Trees are used when we need to store data in ...

Read more

Stack Questions DBOI

Question 4. Min Stack In min stack problem we have to design a stack to implement the following functions efficiently, push(x) –> Push an element x to the stack pop() –> Removes the item on top of stack top() –> Return the element at top of stack getMin() –> Return the minimum element present ...

Read more

Other Questions DBOI

Question 5. Palindrome Number Problem Statement   the problem “Palindrome Number” states that you are given an integer number. Check if it is a palindrome or not. Solve this problem without converting the given number into a string. Example   12321 true Explanation 12321 is a palindrome number because when we reverse 12321 it gives 12321 ...

Read more

Question 6. Data Structure Designing Listening to Data Structure Designing, A lot of people might want to run away looking at the title itself. Those who know me know that I am not leaving until I explain the concept entirely. Embark with me on a journey to learn a problem and a few ideas on ...

Read more

Question 7. Fibonacci numbers Fibonacci numbers are the numbers that form the series called Fibonacci series and are represented as Fn. The first two Fibonacci numbers are 0 and 1 respectively i.e. F=0 and F1=1. Starting from the third Fibonacci number each Fibonacci number is the sum of its previous two numbers in the ...

Read more