As per Cracking the Coding Interview: <\/p>\n
Data Structures<\/strong> Algorithms <\/strong> Concepts<\/strong> As per Cracking the Coding Interview: Data Structures Linked Lists Binary Trees Tries Stacks Queues Vectors\/ArrayLists Hash Tables Algorithms Breadth First Search Depth First Search Binary Search Merge Sort Quick Sort Tree Insert\/Find\/etc Concepts Bit Manipulation Singleton Design Pattern Factory Design Pattern Memory (Stack vs Heap) Recursion Big-O Time<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[15],"tags":[],"class_list":["post-121","post","type-post","status-publish","format-standard","hentry","category-interview-questions"],"_links":{"self":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts\/121","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=121"}],"version-history":[{"count":1,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts\/121\/revisions"}],"predecessor-version":[{"id":122,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts\/121\/revisions\/122"}],"wp:attachment":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=121"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=121"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=121"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nLinked Lists
\nBinary Trees
\nTries
\nStacks
\nQueues
\nVectors\/ArrayLists
\nHash Tables <\/p>\n
\nBreadth First Search
\nDepth First Search
\nBinary Search
\nMerge Sort
\nQuick Sort
\nTree Insert\/Find\/etc <\/p>\n
\nBit Manipulation
\nSingleton Design Pattern
\nFactory Design Pattern
\nMemory (Stack vs Heap)
\nRecursion
\nBig-O Time<\/p>\n","protected":false},"excerpt":{"rendered":"