### Communities

tag:snake search within a tag
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
created:<1w created < 1 week ago
post_type:xxxx type of post
Q&A

Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

# Posts tagged data-structures

About questions related to working with data structures, ways of organizing data that provides better performance when querying/changing some attributes.

This tag doesn't have a detailed wiki yet.

26 posts
62%
+3 −1

One way to remove element from array is to replace element with zero. Below is a rough snippet I am sharing: int N = sc.nextInt(); int pos = sc.nextInt(); int A[] = new int[N]; if(pos == i) { ...

1 answer  ·  posted 5mo ago by abhinavxyz‭  ·  edited 5mo ago by E_net4‭

Question java array
60%
+1 −0

I need to do a lot of calculations involving sets. There are relatively few values in the "universe" of candidates that could appear in any of the sets, but potentially very many such sets (they mi...

1 answer  ·  posted 5mo ago by Karl Knechtel‭  ·  last activity 5mo ago by Karl Knechtel‭

80%
+6 −0

When using the Array.prototype.sort method, we can pass a compare function as argument. Then, this function can be used to process array's elements, so the comparison is made using some custom crit...

2 answers  ·  posted 2y ago by hkotsubo‭  ·  last activity 8mo ago by matthewsnyder‭

70%
+5 −1

Suppose we have N points on XY plane, ie. (x, y) and x, y are integers and multiple queries where each query is of the form y = mx + c and m, c are integers. Is it possible to count number of poin...

2 answers  ·  posted 9mo ago by theabbie‭  ·  last activity 8mo ago by matthewsnyder‭

66%
+2 −0

I learned about the ** operator for array-repeat, and I love it. I have a struct that contains a 2-d array of inner structs, like const D1 = 30; const D2 = 40; const Inner = struct { .a: u32, ....

0 answers  ·  posted 1y ago by aghast‭

60%
+1 −0

To get a value from an assoc and provide a default value if the value does not exist, I am using the following definition: :: at-def ( key assoc default -- value ) key assoc ?at [ drop default ] w...

1 answer  ·  posted 1y ago by Razetime‭  ·  last activity 1y ago by erg‭

Question hashmap factor
33%
+2 −6

I'm attempting a question to do with data structures, file streams & linked lists. The code isn't complete yet as I am still halfway working on it. I am required to use data structures in the d...

1 answer  ·  posted 2y ago by dumplings‭  ·  edited 1y ago by Alexei‭

40%
+2 −4

So I just started learning how to use file-streams in C & decided to attempt a question which is to do with library management in C, however I am currently encountering some problems and feel l...

2 answers  ·  posted 2y ago by dumplings‭  ·  edited 1y ago by Alexei‭

80%
+6 −0

Let's consider the following code: const char a[][4] = {"aa", "aaa"}; const char *b[] = {"bb", "bbb"}; const char *const c[] = {"cc", "ccc"}; For shared libraries, both b and c arrays require...

0 answers  ·  posted 1y ago by alx‭  ·  edited 1y ago by alx‭

60%
+4 −2

A watertight mesh is one which does not have holes, and for which each face has a designated inside and outside. Such a mesh can be "tetrahedralized", has a defined volume, and can be an operand in...

0 answers  ·  posted 2y ago by Josh Hyatt‭  ·  edited 2y ago by Josh Hyatt‭

28%
+0 −3

I am trying to understand this code: const iframes = iFrameResize( [{options}], [css selector] || [iframe] ); The code can be found in this documentation. Is [{options}] an array of objects an...

1 answer  ·  posted 2y ago by deleted user  ·  last activity 2y ago by hkotsubo‭

33%
+1 −4

Credit for User:Meriton for developing the following code (first published here). function replaceIn(e) { if (e.nodeType == Node.TEXT_NODE) { e.nodeValue = e.nodeValue.replaceAll("a", "");...

3 answers  ·  posted 2y ago by deleted user  ·  last activity 2y ago by hkotsubo‭

71%
+3 −0

I've written a class that allows to access dictionary entries of arbitrary dicts with appropriate string keys through attribute access syntax on an instance of the class. My questions are: Is...

2 answers  ·  posted 2y ago by celtschk‭  ·  last activity 2y ago by luser‭

Question python hashmap
71%
+3 −0

I was trying to initialize a simple two dimensional array as follows: const arrays = Array(3).fill([]); However, when I tried to push an entry into one of the arrays, it seems like it gets push...

1 answer  ·  posted 2y ago by Moshi‭  ·  last activity 2y ago by Moshi‭

Question javascript array
66%
+2 −0

I have an array friends = Array.new friends[0] = "Mad man" friends[1] = "hey" There's two ways to print it (using print or puts). At first I tried print print friends which gave: ["Mad...

1 answer  ·  posted 3y ago by deleted user  ·  edited 2y ago by Trilarion‭

Question ruby array output
77%
+5 −0

Suppose I am using a Java API from Kotlin and I want to call a function that takes a FloatArray (represented as float[] in Java), and I have an Iterable<Float> as my input data type. To be mo...

1 answer  ·  posted 2y ago by Josh Hyatt‭  ·  edited 2y ago by Alexei‭

Question array kotlin iterable
28%
+0 −3

Could someone explain this part of the coding for data structures & linked list? I actually got this code from a textbook but no matter how I read the textbook, I still don't get the concept &a...

1 answer  ·  posted 2y ago by hamburgersarecool‭  ·  last activity 2y ago by Alexei‭

37%
+1 −3

I would like to delete a book from the collection by a particular title from my library if the user enters 2 as input for my switch statement. How can I do that with my current code? #include<...

0 answers  ·  posted 2y ago by hamburgersarecool‭  ·  edited 2y ago by hamburgersarecool‭

75%
+4 −0

I have a map and a new item to add to the map and a list of keys I want to attach the new item to: => m1 {:a 1 :b 2} => itm 3 => ks [:c :d :e] => m2 {:a 1 :b 2 :c 3 :d 3 :e 3} ...

2 answers  ·  posted 2y ago by NoahTheDuke‭  ·  edited 2y ago by Alexei‭

Question clojure dictionary
75%
+4 −0

If I have a one-dimensional array, I can get the length of it quite easily: var x = moves.Length(). However, if the array is multi-dimensional, .Length() returns the total number of elements. If ...

2 answers  ·  posted 2y ago by FrankLuke‭  ·  last activity 2y ago by FoggyFinder‭

60%
+1 −0

This is the worst bug I have ever seen.. I was fetching CallLogs following way. ArrayList<HashMap<String, String>> callLog= new ArrayList<>(); HashMap<String, Strin...

1 answer  ·  posted 2y ago by Anonymous‭  ·  last activity 2y ago by Anonymous‭

80%
+6 −0

I wish to fill an array with strings, using Bash scripting. The strings are in a file, one per line. Here is what I've tried: declare -a my_array=() while read line; do my_array+=( "\$line"...

3 answers  ·  posted 3y ago by LVx0‭  ·  edited 2y ago by Alexei‭

Question array bash console stdin
42%
+1 −2

No, I'm not trying to get the full program written completely in C by you guys. I only need some way to implement the functionalities of each function I found confusing. In this challenge in Code ...

2 answers  ·  posted 2y ago by General Sebast1an‭  ·  last activity 2y ago by Derek Elkins‭

Question c javascript array
44%
+2 −3

I understand data compression as making data structures nearer (if they are mere machine code without any abstract representation) or representing them in less and less abstract computer languages ...

2 answers  ·  posted 3y ago by deleted user  ·  edited 3y ago by deleted user

60%
+1 −0

In Dyalog APL, there's a predefined function in the dfns library to generate a matrix of permutations for a list of the numbers from 1 to n. I want to create the same functionality, except that it...

1 answer  ·  posted 3y ago by Razetime‭  ·  edited 3y ago by Alexei‭

77%
+5 −0

For holding ordered sets of keys, there are well-known data structures (the red-black tree, for example) that support O(log(n)) lookup and insertion algorithms. Of course this means that there triv...

0 answers  ·  posted 3y ago by r~~‭  ·  edited 3y ago by r~~‭