Tech Interview Handbook

The “Tech Interview Handbook” is a comprehensive resource that delves into various aspects of technical interviews. It covers topics such as Python programming speed considerations, AI applications with short-term memory in databases, data augmentation for machine learning, and the importance of deterministic architectures in enterprise AI systems. The handbook explores the challenges of generative AI, the need for understanding over indexing in data processing, and the significance of context in search mechanisms. It also emphasizes the use of advanced technologies like Spark, EMR, Airflow, and vector embeddings to enhance data processing and knowledge retrieval in technical interview scenarios.

Visit Tech Interview Handbook

Geometry cheatsheet for coding interviews

Introduction Geometry is a branch of mathematics that is concerned with properties of space that are related with distance, shape, size, and relative position of figures. Advanced geometry (e.g. 3D ...

Math cheatsheet for coding interviews

Tech Interview Handbook

Introduction Math is a foundational aspect of Computer Science and every programmer and computer scientist needs to have basic mathematical knowledge. Thankfully, for the purpose of coding interview...

Binary cheatsheet for coding interviews

Tech Interview Handbook

Introduction Knowledge of binary number system and bit manipulation is less important in coding interviews as most Software Engineers do not have to deal with bits, which is more commonly used when ...

Dynamic programming cheatsheet for coding interviews

Tech Interview Handbook

Introduction Dynamic Programming (DP) is usually used to solve optimization problems. The only way to get better at DP is to practice. It takes some amount of practice to be able to recognize that a...

Trie cheatsheet for coding interviews

Tech Interview Handbook

Introduction Tries are special trees (prefix trees) that make searching and storing strings more efficient. Tries have many practical applications, such as conducting searches and providing autocomp...

Heap cheatsheet for coding interviews

Tech Interview Handbook

Introduction A heap is a specialized tree-based data structure which is a complete tree that satisfies the heap property. Max heap - In a max heap, the value of a node must be greatest among the nod...

Graph cheatsheet for coding interviews

Tech Interview Handbook

Introduction A graph is a structure containing a set of objects (nodes or vertices) where there can be edges between these nodes/vertices. Edges can be directed or undirected and can optionally have...

Tree cheatsheet for coding interviews

Tech Interview Handbook

Introduction A tree is a widely used abstract data type that represents a hierarchical structure with a set of connected nodes. Each node in the tree can be connected to many children, but must be c...

Interval cheatsheet for coding interviews

Tech Interview Handbook

Introduction Interval questions are a subset of array questions where you are given an array of two-element arrays (an interval) and the two values represent a start and an end value. Interval quest...

Stack cheatsheet for coding interviews

Tech Interview Handbook

Introduction A stack is an abstract data type that supports the operations push (insert a new element on the top of the stack) and pop (remove and return the most recently added element, the element...

Queue cheatsheet for coding interviews

Tech Interview Handbook

Introduction A queue is a linear collection of elements that are maintained in a sequence and can be modified by the addition of elements at one end of the sequence ( enqueue operation) and the remo...

Linked list cheatsheet for coding interviews

Tech Interview Handbook

Introduction Like arrays, a linked list is used to represent sequential data. It is a linear collection of data elements whose order is not given by their physical placement in memory, as opposed to...