Scribd
Upload
56 views8 pages

ML DS Interview Cheat Sheet

This document discusses different data structures used in machine learning and data science interviews. It provides information on list, linked list, stack, queue, hash table and tree data structures. For each it describes the structure, order of elements, operations like push, pop etc and provides a real world example. The document is from www.1stepgrow.com and encourages the reader to build their career and follow the 1stepGrow Academy.

Uploaded by

Kalaiselvi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views8 pages

ML DS Interview Cheat Sheet

This document discusses different data structures used in machine learning and data science interviews. It provides information on list, linked list, stack, queue, hash table and tree data structures. For each it describes the structure, order of elements, operations like push, pop etc and provides a real world example. The document is from www.1stepgrow.com and encourages the reader to build their career and follow the 1stepGrow Academy.

Uploaded by

Kalaiselvi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

www.1stepgrow.

com

MACHINE LEARNING
AND DATA SCIENCE
INTERVIEW CHEAT SHEET
DATA STRUCTURES
PART-10
www.1stepgrow.com

1. List
Ordered collection of elements
The position of each element is defined by the index
The elements can be accessed in any order

len = 4

value 12 2 0 6 18

index 0 1 2 3 4
www.1stepgrow.com

2. Linked List
Linked List does not have their order defined by their
physical placement in the memory.
Contiguous elements of the linked list are not placed
adjacent to each other in the memory.

12 2 0

Each linked list element contains both the values and the
address (pointer) to the next linked list element.
Hence the linked list can only be traversed sequentially
going through each element at a time
www.1stepgrow.com

3. Stack
Stack is a sequential data structure which maintains the
order of elements as they were inserted in.
Last In First Out (LIFO) order, which means that the
elements can only be accessed in the reverse order as they
were inserted into the stack.
The element to be inserted last, will the first one to get
removed from the stack.
Push() adds an element at the head of the stack, while
pop() removes an element from the head of the stack
A real-life example of a stack is a stack of kitchen plates

push() pop() top()

6
6 6

6 6 6 6

0 0 0 0 0 0

2 2 2 2 2 2

12 12 12 12 12 12

before after before after before after


www.1stepgrow.com

4. Queue
A queue is a sequential data structure that maintains the
order of elements as they were inserted in
First In First Out (FIFO), the element to be inserted first, will
the first one to get removed from the queue
Whenever an element is added (Enqueue()) it is added to
the end of the queue. On the other hand, element removal
(Dequeue()) is done from the front of the queue.
A real-life example is a check-out line at a grocery store

Enqueue() Dequeue()

before 0 2 after 0 2 12

end front end front


18 12

after 18 0 2 before 0 2

end front
end front
www.1stepgrow.com

5. HashTable
Creates paired assignments (key mapped to values) so the
pairs can be accessed in constant time
For each (key, value) pair, the key is passed through a hash
function to create a unique physical address for the value to
be stored in the memory.
Hash function can end up generating the same physical
address for different keys. This is called a collision.
www.1stepgrow.com

6. Tree
Maintains a hierarchical relation between its elements.
Root Node − The node at the top of the tree
Parent Node − Any node that has at least one child
Child Node − The successor of a parent node is known as
a child node. A node can be both a parent and a child node.
The root is never a child node.
Leaf Node− The node which does not have any child node.
Traversing − Passing through the nodes in a certain order,
e.g BFS, DFS
www.1stepgrow.com

Build your career story with


1stepGrow Academy
Follow 1stepGrow Academy
Share your Comments

Save the Post

You might also like