Data-structures Questions

I'm learning about binary trees in c and i wrote a function to search my tree which is a tree of strings. it works, however, it seg faults if the

When we consider dynamic arrays in java or python (list), the average time complexity is o(1) for appending an element and worst

If string is basically a pointer then how does it behave as an array? ie: you can use say: char *s = "david"

I'm trying to improve my knowledge on algorithms and data structures, so for the last 5-6 days i've been trying to implement different algorithms

I have this code for stack implementation using arrays with pointers which performs lot of operations like push, peep, pop, destroy. i already

I am trying to add new node to my linked list, but it's gives memory error my struct and global vars: typedef struct word

I need some help in the ways of implementing a faster way to do a full shift on a two-dimensional array. my problem is i have a 2

I want to count how many time duplicate numbers repeat in list. i have written the code that only find the duplicate numbers in list but my

I have the following tables in my database that have a many-to-many relationship, which is expressed by a connecting table that has foreign keys

How would you model a simple musical score for a single instrument written in regular standard notation? certainly there are plenty of libraries

I'm trying to build a binary search tree. inserting an integer using insert function (only using 1 to 100 for testing) and appending the result to

My problem is the following: i have to create a tree from a file .txt, this is an example of what is inside the file:

So i'm learning data structures and pretty much new to c. i am trying to make a function that accepts student id and the course number and the

While calculating the hash table bucket index from the hash code of a key, why do we avoid use of remainder after division (modulo) when the size

I am learning data structures and pretty much new to c. i can't figure out what's causing the error in this function: struct

I want to be able to get a list of all differences between two javascript object graphs, with the property names and values where the deltas

I recently had a coding test during an interview. i was told: there is a large unsorted array of one million

I have a data structure that represents a directed graph, and i want to render that dynamically on an html page. these graphs will usually be

I just saw this behaviour and i'm a bit surprised by it... if i add 3 or 4 elements to a dictionary, and then do a "for each" to get all

I'm working on a nodejs project where i need to restructure an array of objects. below is the sample out put i get from database,

[{ country: "us", languages: [ "en" ] }, { country: "be", languages: [

I have created an api in the backend which will store images to the database, i created a function for uploading the images but i get an empty

I'm a programming noob. i want to allocate a struct but since the size of my attributes are already defined, how would i use malloc() in this

I have a requirement where the product needs to implement undo-redo functionality. currently i hold a huge object which comes from a

I am cleaning multiple pdf files. and i have combined two dictionaries to get three outputs. the file name which is key, the

I have 5 activities in my project, where one activity leads to another in the following manner: selection selecttype

I have a set of 32 bit integers with which i will be making a data structure that will put these integers in different components ( like dsu ) the

Here's my declaration of a trie in c++ using unordered_map class trie{ public: unordered_map<char,trie*>m; bool

After fetching data from an api on react, i have the following json data. then i use .map method to loop over each object and display

I tried implementing the following code. but according to logic, the path output for node "a" to "d" is displayed none, though the path can be

I have some concerns about the structure for a firestore-based project, since directly nesting documents don't seem to be an option. to

I have a question. i develop a feature waht user allow to like a task. for example:

I am trying to create a post for firebase's database. the structure is a bit complex. the json format for the structure is this:

I'm creating a "deep" path scheme in firestore. (6 part path, 3 collections and 3 documents) something like

I'm learning data structure with javascript and my focus now on how to implement deque? edite: from comments below

The function handlefeetandinch updates the state using index while using array.map and passing the function which updates the state but the state

I notice that in some js objects, they have properties with some special behaviours. for example, the model objects in sequelize, if i log a model

I'm writing a parser to print a file json on my mobile. i include an arraymap to save data received from the file. my problem is that when i have

For homework we have been asked to build a dictionary from csv (without importing csv or any other lib, only using built in python functions).

I've implemented an avl tree in c++ and would like to stress test

For example, if you have an array [20, 6, 7, 8, 50] and if i pass value 21 it should return [6,7,8] this sub array. note: the sum of number should

I wrote a stored procedure that takes two types i created as parameters, called type1 and type2 : create

I'm reading through cormen et. al. again, specifically the chapter on btrees, and i am implementing one in c. however, i had a question about

I've the below dictionary (geojson): 'properties': { 'fill': '#ffffff', 'fill-opacity': 1, 'stroke': '#ffffff',

I have this object below. i was wondering how i can select a specific item and update a property. for example. item 1 i want to add a task in the

I'm trying to write a function to create a tree from a given starting directory. in other words, i choose a directory, and then the function maps

I'm new to python and i have a question on involving data structures and algorithms(which are essential skills that a programmer should have)

Hey guys i need some help to structure some data, but i would need some insights to do this as performant as possible. i have been losing my head

I have a list of products in my database as follows: database

I need to retrieve the length of sequences, which numbers are all greater than an arbitrary chosen value x (some

I have this array: var array ={data: [ { id:'1', name:'first', data:[] }]} and i

This question is purely syntax. i'm trying to insert a generated json object into another json object. let's say my json looks like

Class node : def __init__(self, newdata=none, newartist=none, nextnode=none): self.data = newdata self.artist =

Intro i have a firestore database similar to a social media db, with 3 collections users, events, and eventupdates. my goal

This is how i pull data from google sheets: map<double, double> m = (await sheet.values.map.column(3, fromrow: 2)).map((

I am using heapq in python 3.7 i have two questions about heapq: i don't know how to keep the heap invariant efficiently if

I feel that the time complexity of this js function i wrote is o(n) but at the same time it feels like its o(n^2). what's the correct time

I am trying to randomly match two elements from list and tuple. my goal is to create a string with 1 to 1 match. below is the ideal code i

The structure of my firebase database is: users: [ {userid: {...}}, // private data for specific user ... ], likes: [ //

In python3, what is the least time-consuming way of comparing two sets elements(whether they

I'm trying to insert a node at the tail but my list keeps just saving the last value if i try to insert 1,5,7 at the head and 9 at tail..i

Using a disjoint set forest, we can efficiently

I have a question about bisect and heapq. first i will show you 2 versions of code and then ask question about it. version

I have the following lists: a = ['a', 'b', 'c', 'c'] b = ['2', '3', 2, 3] i am zipping them as follows in order

I've been working on a snapchat clone as a way to learn how to use firebase. i am currently stuck on how to best structure my data so that

Let's say i have a list of pattern [2, 1] and given a length = 5. the pattern means that there are sets of 2 and

Q ) to reverse two linked lists, add them and return a reversed linked list of the sum`

I've created list of maps using the following list<map<object, string>> postmodel = new arraylist<>();

I have a folder of txt files and also a csv file with additional data like categories a particular txt document belongs to and the original source

How to make a listview table be zipped every 4. items instead of 1 white 1 black.. i managed to do however with odd or even numbers here is the

I'm trying to write a javascript function that compares two binary trees defined by treenodes a and b and returns true if they are

I am having this bug where my program unexpectedly exits after entering elements for my array-based queue. it is supposed to run like so:

I need to create a method public static treeset<string> getset(string s) in java that takes an inputted string and does the

I am currently working on an app that will connect clients and craftsmen. right now i am structuring the database and thinking about possible

For example: input: //mxn matrix matrix = [ [ 0, 0, 1 ], [ 1, 1, 0 ], [ 0, 1, 1 ] ]

I have a tree generated at python and i just simply want to append a new child to a parent however, although the children of the child no is

Context i'm working on a python script that manipulates statistics provided by google relatively to installed apps from the play store.

Context i am looking to export a dictionary which contains a list of dictionaries as the value of each key:value pair:

I have implemented a binary search tree and it is working fine except for the case where i have to delete a node with two children. the following

I am trying to solve a word puzzle with 5 alphabets, which can have 3 , 4 and 5 letter words . how should i write my algorithm to make this

I want to save the final value on a linkedlist of 5000000 integers by using an iterator. for this assignment, i need to traverse through the

Need to convert an array like: [ {value: 'a', depth: 1, children: []}, {value: 'c', depth: 2, children: []}, {value: 'd',

Lets say i have a string s and words are keep on adding to the string at any given point of time. now i have to maintain top 10

I have created app whose structure looks like this. current structure for one company only. let current = { products: {

I'm quite new to data structures but i was trying to implement an efficient city lookup / city autocomplete feature on the back-end of my

Problem is to return any one combination from given array that sums up to the target. i'm new to c++. how can i complete the function howsum()

What exactly is a "list" in javascript? i got asked this question and i'm a professional of five years but this made me fumble. i

Given a javascript map of (key, value) pairs. find the 'key' of highest frequency 'value' ( say

How to take the other(unmatched value) from tuple? for example: i have val = 'y' and t = ('y', 'n')

Say you want to have a set of 1- to 2-digit hexadecimal numbers, so 256 numbers. just using a small set to get at the problem, but it would work

I am using cassandra with python and i am executing two queries together. i want to group the results of the results together into a single list

Good day, i have a data frame with a column like this, let us assume with 1000rows but here is a sample: a 12 24 36 48

I want to present all the posts ,of the pages, which the user follow. i have table "followings" with the fields "user_id" and "page_id"( for

I have an arraylist and i want to display in a hierarchal structure. i want the results to look like this. if it doesn't have any child

I'm making an hashing table data structure and having segmentation fault error on my inicialization function. here the code: void

Test case: input: 5 -1 0 0 1 1 2

I have made this program to save the information about a book but it doesn't print it correctly #include <stdio.h> enum

I monitor the filesystem event, and store event using path as key, when multiple event of a path occures i need find a the previous event and

Recently, i've been working on a very large application using react+redux with reselect to memoize data and prevent unnecessary re-renders, and

Below is the java code to find the kth smallest number in array. this code is for elementary version, not using pivot-index.