Just beginning my journey of learning data structures and algorithms, and I’m getting hung up on the fact that there is information everywhere about this kind of stuff with different nicknames for each data structure. But in layman’s terms are all queues in fact priority queues, the priority bit being exactly what makes them so… Read More Are all queues, priority queues? If not, what is the difference?

int function2(int n) { int i, j, k; int sum = 0; for (k = 1; k <= n; k += 1) { for (i = 1; i <= n; i *= 3) { j = i; while (j > 1) { sum += 1; j /= 3; } } } return sum; } I… Read More What is the time complexity of function2?

I google the solution for the longest consecutive sequence algorithm here is the link to the question in leetcode leetcodeQuestion and below is the algorithm solution. I was confused by some of the comments on the website where i got the solution some where saying that the solution is not O(n) time complexity since there… Read More What is the Big o notation of the longest consecutive sequence algorithm below

What will be the time complexity for this function, can someone explain? void fun(int n) { int i,j,k, count = 0; for(i = n/2; i <= n; i++) for(j = 1; j <= n; j = 2*j) for(k = 1; k <= n; k++) count++; } I am trying to find the time complexity for… Read More Time complexity of a Function in c++

I would like to know how fast is SELECT * FROM user_table WHERE email = ‘test@gmail.com’ is this O(1) or O(n)? how does sql search for a particular row? >Solution : If there is no index on "email" column, the search complexity is O(N). If there was hash-based index on an "email" column, then the… Read More What is a runtime complexity of this sql query?

I want to find the depth of a node in a binary tree where the depth of the empty tree is defined as -1 and the depth of a node is defined as 1 greater than its parent. Input is v Output is the depth of v Procedure Depth(v) if v = null then return… Read More What is the time complexity of finding the depth of a binary tree given my algorithm?

I’m learning big O notation and solving some problems, since i’m very new to this subject, i would like to know the complexity of this algorithm. function findSum(arr,value){ const set = new Set(); for (let val of arr) { set.add(val); } const res = []; for (let val of set) { const target = value… Read More What is the complexity for this algorithm?

I am a bit confused about the time complexity, in the case of two seperate while loops. I am aware that the code: while(i<N){ code while(k<N){ code } } will have a complexity of O(n^2) What about the case where we don’t have nested loops, though? while(i<N){ } while(k<N){ } >Solution : So you run… Read More Big O Time Complexity of While Loops

This function simply takes multidimensional array and makes it flat for example flatArray([1,[1,2,4,[2,3]],1]) -> [1,1,2,4,2,3,1] I would like to know what time complexity this algorithm has. let flatArray = function(numsArr){ let container = []; for(let i = 0;i<numsArr.length;i++){ if(Array.isArray(numsArr[i])){ container = […container,…flatArray(numsArr[i])] }else{ container.push(numsArr[i]) } counter ++ } return container; }; >Solution : Your function… Read More Can you tell me what is the runtime complexity of this algo?

What would be the time complexity for this snippet? I’m having a little trouble understanding how to find the time complexity of nested for loops with different conditions. I originally thought that it would be n^3 x n^2 which gives O(n^5), but should it be (n^3)^2 which gives O(n^6)? for(int i = 0; i <… Read More Time Complexity of nested for loops with different conditions