×

# Data Structures for INOI!!

 0 So most people say that the most important things for INOI and dp and graphs but what are the most import data structures? asked 21 Dec '16, 13:58 2.5k●2●19 accept rate: 8%

 0 Arrays and strings are by far the most important data structures in INOI Boring? Maybe. Important? Yes. The most important non-trivial data structure in INOI is the hash map because of its versatility and constant-time operations. If you don't know how to use a hash map, learn now. Next in line are linked lists, stacks, queues, and trees. You need to know these inside and out. In the next tier are graphs, priority queues, and heaps. You should still know these, but they appear more rarely. In the bottom tier are lesser known data structures like bit sets, tries, disjoint sets, specific cache implementations, etc. It doesn't hurt to prepare for some of these, although they appear most rarely. And yes map, unordered map. answered 21 Dec '16, 21:36 4★only4 1.5k●1●9 accept rate: 17%
 0 As you have correctly stated dp and graphs are most popular type of problems so data structures related to these also become important i.e Arrays (for dp) and stacks,queues,trees,adjacency list/matrix, priority queues etc. (for graphs) . Knowing about these inside out is critical and first thing to learn but equally important is the fact that how you use Data Stuctures in libraries built in for your language (eg using Sets maps etc. Built in STL). Apart from this you may check out bitset in STL it is sometimes quite useful. answered 22 Dec '16, 22:45 539●8 accept rate: 27%
 2 The most you may require is sets and maps according to me answered 21 Dec '16, 15:34 337●5●21 accept rate: 7% Seeing you active after long time at the Forum.Can you give more idea on how should i prepare for this 20 days for INOI. (21 Dec '16, 15:39) Just chill.... don't panic, and don't ignore any subtask in INOI (I didnt get to IOITC last yr bcoz of this :( ) (22 Dec '16, 21:45)
 0 Stacks, Queues, Priority Queue, Heaps. answered 21 Dec '16, 14:45 593●3●24 accept rate: 8% Do you know of some tutorials (21 Dec '16, 15:09) Yeah dear for Stacks & Queues i would suggest https://www.youtube.com/watch?v=92S4zgXN17o&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P also you can look at www.geeksforgeeks.org tutorials for Heaps https://youtu.be/t0Cq6tVNRBA?t=23 there is also www.xoax.net tutorials. (21 Dec '16, 15:21) I don't that there is enough time to understand how they work and also how they are implemented so can you give me some tutorials on using inbuilt data structures. (21 Dec '16, 17:04) Didn't get you, Can you be more clearer? (21 Dec '16, 18:44) What about containers section of this http://www.cplusplus.com/reference (21 Dec '16, 18:46) Yes, but remember the priority_queue is somewhat different than what you'd expect (21 Dec '16, 20:24) @mathecodician you may also ask the same question by sending a mail to ico@iarcs.org.in (21 Dec '16, 21:40) showing 5 of 7 show all
 0 I think knowing about Disjoint Set datastructure (UFDS) may also be helpful. answered 21 Dec '16, 15:31 125●5 accept rate: 0%
 0 Stacks, Queued, Heaps, Hashing and graph is also important in my opinion. answered 21 Dec '16, 18:23 11●2 accept rate: 0%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×761
×269

question asked: 21 Dec '16, 13:58

question was seen: 700 times

last updated: 22 Dec '16, 22:45