How to recognize which Data Structure to use in a question? | Geek-O-Lympics | GeeksforGeeks

You buckle up yourself and sit down to solve some problems. You start your PC and go through the problem statement.

The next thing you know is you are stuck in a huge dilemma whether to go with arrays or linked list. Will using stacks and queues make your task at hand easier or will it complicate it unnecessarily?

If this is something that has been troubling you every time you code. If you face a lot of problems when tackling these questions, then worry not!!

As none other that Striver himself is here to help you on how you can recognize which data structure to use in your question efficiently.

So tag along and make Data Structures your go to friend and not a foe you fear!!

---------------------------------------------------------------------------





---------------------------------------------------------------------------

Follow On Our Other Social Media Handles:


#geeksforgeeks #gfg #coding #striver

[hardikaggarwal]

9:10 : Two pointers discussion starts
10:56 : Two pointers discussion ends
11:02 == sliding window discussion starts
12:26 == sliding window discussion ends
12:27 : hashing discussion starts
12:57 : hashing discussion ends
13:01 : binary search discussion starts
16:58 : binary search discussion ends
17:11 :stack discussion starts
19:52 : stack discussion ends
19:53 : queue discussion starts
21:59 :queue/monotonic stack discussion ends
22:02 : linkedlist discussion starts
22:23 :linkedlist discussion ends
22:24 :bit manipulation discussion starts
23:28 : bit manipulation discussion ends
23:30 : recursion discussion starts
25:59 : recursion discussion ends
26:07 : backtracking discussion starts
28:52 : Backtracking discussion ends
28:56 : Greedy algorithm discussion starts
31:39 :Greedy algorithm discussion ends
31:42 :trees discussion starts
35:28 : Trees discussion ends
35:31 : Graph discussion starts
40:26 : Graph discussion ends
40:31 : DP discussion starts
42:07 : tries discussion starts
43:02 : Tries discussion ends
43:16 : Strings discussion starts
44:26 : Strings discussion ends
52:58 : Imp DP problems to cover all patterns discussion starts
53:36 : Discussion ends

[takeUforward]

I loved the conversation ♥️, for all playlists you can follow this channel.

[UdayTejaOriginal]

This was gold guys! Giving shape to your thought process!

[secretdreams]

Thankyou Striver! very informative session❤

[rohitkumaram]

@Striver, I think backtracking is called so because, u may or may not comeback few steps once u find ok this recursion set/path is going to fail for the required answer.

That is difft from normal recursion where we are just interested in all subsets, valid anagrams, sub-sequence kind of problem.

This is my understanding, I m no one even close to you, but trying to improve 1 step at a time.

[palakjain]

could someone post the points/problems discussed above? It was an interesting discussion, especially liked the part where the red guy mentioned the standard questions for each topic.

[anshuraj]

Recursion is literally my nightmare. I just can't understand how to use it in problems.

[Aryan-wlmc]

I am facing problems coz my percentage in 12th is less than 60% 😓

[minatokuns]

where is the link he talked about in the end?

[rosepainting]

we use A* algorithm in game development here