Algorithms And Data Structures Preparation for Software Engineer

What do we cover?

1. ARRAYS

• Get product of all element accept at index i
• Calculate maximum sub-array sum
• Calculate maximum circle sub-array sum
• Smallest window need to be sorted
• Count smaller elements to the right

2. STRINGS

• Arrays
• Back tracking
• Binary search
• Dynamic programming
• Graphs
• Hash tables
• Heaps
• Linked list
• Searching
• Stack and queue
• Trees
• Strings
• Tries