I want to determine the time complexity of the below code 👇 function random(a){ let i; let num=Math.floor((Math.random()*(a+1))) return num; } function fuc1(n){ let i; if(n<=0){ alert("condition false ") return 0; }else{ i=random(n-1); console.log("thisn") return fuc1(i)+fuc1(n-1-i); } } fuc1(6) I…
Given a object whose keys are projects and values are dependencies. I've been trying to assemble a nested tree structure without any represented circular dependencies (think files and folders). Here's a simple example: { 'a': ['b'], 'b': ['c'], 'c': [],…
Context I have the table "user_numbers" with the following records: id user_id number 1 3 123 2 3 666 3 4 123 4 5 666 5 6 555 I want to build query that find all user numbers and all…
I have two JPA entities with a @ManyToMany relationship, for example Student and Course, something like that: Student Entity: @ManyToMany List<Course> courses; Course Entity: @ManyToMany List<Student> students; What is the best way/pattern to implement a Spring REST controller which returns…
Sample 1: function mergesort(arr){ if (arr.length > 1){ let mid = parseInt(arr.length/2); let left = arr.slice(0,mid); let right = arr.slice(mid); mergesort(left); mergesort(right); return merge(left,right); } else return arr; } Sample 2: function mergesort(arr){ if (arr.length > 1){ let mid =…
I need help with complex tree walking. I should find a match in a tree, then find another item at the SAME path depth. EG it will ALWAYS be at the same amount of layers deep, but will appear in…
I have an array of object that look this, const data = [ { "key": "group1", "name": "groupname1", "total": 65, "available": 34, "children": [ { "key": "cat1", "name": "category1", "total": 5, "available": 2, "children": [] }, { "key": "cat2", "name":…
I am having array of items with following order: const arr = [ { group: { id: "group1", groupname: "groupname1" }, categories: [ { id: "cat1", categoryName: "category1", total: 5, available: 2, subCategories: [] }, { id: "cat2", categoryName: "category2",…
I have an array of object that look this, const data = [ { key: "id1", name: "Category 1", curr: 0, total: 0, nodes: [ { key: "id2", name: "Applications", curr: 20, total: 30, nodes: [ { key: "id3", name:…
Why does this recursive function work? let arr = [] function rep(x, n) { if (Math.sign(x) === -1) { return [] } if (x < 1) { return 1 } else { rep(x - 1, n) } arr.push(n) return arr…