Algochallenges
86 subscribers
1 link
Daily algorithm questions with explanations. Prepare for your next coding interview!
Download Telegram
Channel created
Channel photo updated
Elements in an array are accessed _____
Anonymous Quiz
22%
Randomly
72%
Sequentially
0%
Exponentially
6%
Logarithmically
Process of removing an element from stack is called __________
Anonymous Quiz
1%
Create
4%
Push
3%
Evaluation
91%
Pop
How many children does a binary tree have?
Anonymous Quiz
44%
2
24%
0 or 1 or 2
23%
Any number of children
9%
0 or 1
Process of inserting an element in stack is called ____________
Anonymous Quiz
4%
Create
95%
Push
0%
Evaluation
1%
Pop
What is the worst case time complexity of a quick sort algorithm?
Anonymous Quiz
10%
O(n)
36%
O(n*log(n))
44%
O(n^2)
11%
O(log(n))
3. What must be the ideal size of array if the height of tree is ‘l’?
Anonymous Quiz
69%
2^l-1
16%
I-1
3%
I
11%
2I
How often do you want algo questions?
Anonymous Poll
16%
Once every other day
28%
Once per day
55%
Twice per day
In quicksort, which of the following methods is the most effective for picking the pivot element?
Anonymous Quiz
11%
first element
6%
last element
66%
median-of-three partitioning
17%
random element
The average depth of a binary tree is given as?
Anonymous Quiz
14%
O(N)
14%
O(√N)
16%
O(N2)
56%
O(log N)
If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
Anonymous Quiz
57%
2i+1
22%
2i+2
19%
2i
2%
4i
Using what formula can a parent node be located in an array?
Anonymous Quiz
47%
(i+1)/2
22%
(i-1)/2
20%
i/2
12%
2i/2