Sorting

• Introduction to Sorting
• Basics of Asymptotic Analysis and Worst Case & Average Case Analysis
• Different Sorting Algorithms and their comparison
• Algorithm paradigms like Divide & Conquer, Decrease & Conquer, Transform & Conquer
• Presorting
• Extensions of Merge Sort, Quick Sort, Heap Sort
• Common sorting-related coding interview problems

Recursion

• Recursion as a Lazy Manager's Strategy
• Recursive Mathematical Functions
• Combinatorial Enumeration
• Backtracking
• Exhaustive Enumeration & General Template
• Common recursion- and backtracking-related coding interview problems

Trees

• Dictionaries & Sets, Hash Tables 
• Modeling data as Binary Trees and Binary Search Tree and performing different operations over them
• Tree Traversals and Constructions 
• BFS Coding Patterns
• DFS Coding Patterns
• Tree Construction from its traversals 
• Common trees-related coding interview problems

Graphs

• Overview of Graphs
• Problem definition of the 7 Bridges of Konigsberg and its connection with Graph theory
• What is a graph, and when do you model a problem as a Graph?
• How to store a Graph in memory (Adjacency Lists, Adjacency Matrices, Adjacency Maps)
• Graphs traversal: BFS and DFS, BFS Tree, DFS stack-based implementation
• A general template to solve any problems modeled as Graphs
• Graphs in Interviews
• Common graphs-related coding interview problems

Online Processing Systems

• The client-server model of Online processing
• Top-down steps for system design interview
• Depth and breadth analysis
• Cryptographic hash function
• Network Protocols, Web Server, Hash Index
• Scaling
• Performance Metrics of a Scalable System
• SLOs and SLAs
• Proxy: Reverse and Forward
• Load balancing
• CAP Theorem
• Content Distribution Networks
• Cache
• Sharding
• Consistent Hashing
• Storage
• Case Studies: URL Shortener, Instagram, Uber, Twitter, Messaging/Chat Services

Batch Processing Systems

• Inverted Index
• External Sort Merge
• K-way External Sort-Merge
• Distributed File System
• Map-reduce Framework
• Distributed Sorting
• Case Studies: Search Engine, Graph Processor, Typeahead Suggestions, Recommendation Systems

Module 1 - Android UI Programming

• Deep dive into app life-cycle intricacies. Interesting interview questions around App life-cycle. E.g., Explain the difference between inactive, backgrounded, and suspended app states.
• Deep dive into building UI involving usage of grid list layout, recycler view, pagination, infinite scrolling, live data, and view model
• Challenging design questions around building custom views
• Deep dive into Jetpack Navigation and Jetpack Stateflow

Module 2 - Network and Memory Management

• Interesting interview questions around making network requests and handling responses
• Challenging design questions to involve making paginated network calls. E.g., Strategies to reduce the load time of the TikTok application.
• A detailed discussion of data persistence strategies through interview questions. E.g., Design offline features of the WhatsApp application. 
• Questions related to caching: when to cache? Which database to use for caching?

Module 3 - Concurrency, Debugging, and Profiling

• Interesting questions around designing applications that make use of Content Provider
• Deep dive into implementing concurrency while building iOS applications involving concepts like Executors, Services, and Job scheduler
• Deep dive into Debugging, Testing, Profiling, and Performance (CPU and Memory)

15 mock interviews

Take classes you missed/retake classes/tests

1:1 technical/career coaching