This course covers
Introduction to time complexity notation
Strings and subarrays
Linked Lists and Stacks and Queues
Breadth and Depth First Search
Dynamic Programming / Greedy Algorithms
Harsh is a computer science graduate from IIT Kanpur. He is currently working as a Data Scientist at Envestnet Yodlee. He has also worked as a research intern at UT Dallas.