Coding Interview
A coding interview is a technical assessment in which a candidate solves algorithmic or data-structure problems, usually under time pressure and while explaining their reasoning aloud, either on a whiteboard, shared document, or live coding platform. It evaluates problem-solving process, code correctness, and…
52 resources across 2 libraries
Glossary Terms(13)
Resume
A resume is a concise document summarizing a candidate's work experience, education, skills, and achievements, used to apply for jobs. It typically fits on one…
ATS Resume
An ATS resume is a resume specifically formatted to be reliably parsed and ranked by an Applicant Tracking System — the software many employers use to collect,…
Portfolio
A portfolio is a curated collection of work samples — projects, code, designs, writing, or case studies — that demonstrates a candidate's skills and judgment i…
System Design
System design is the process of defining the architecture, components, interfaces, and data flow of a software system to satisfy specified functional and non-f…
Coding Interview
A coding interview is a technical assessment in which a candidate solves algorithmic or data-structure problems, usually under time pressure and while explaini…
STAR Method
The STAR method is a structured technique for answering behavioral interview questions by describing the Situation, Task, Action, and Result of a specific past…
LeetCode
LeetCode is an online platform offering coding problems focused on algorithms and data structures, widely used to prepare for technical coding interviews at so…
HackerRank
HackerRank is an online platform for coding practice and technical skill assessment, offering programming challenges across multiple domains as well as tools e…
Codewars
Codewars is an online platform for practicing coding through community-created challenges called "kata," ranked by difficulty using a martial-arts-inspired bel…
Stack Overflow
Stack Overflow is a question-and-answer website for programmers, where users ask technical coding questions and the community answers and votes on solutions, b…
System Design Interview
A system design interview is a hiring interview format where a candidate designs the architecture of a large-scale system — such as a URL shortener, chat app,…
Take-Home Assignment
A take-home assignment is a hiring exercise where a candidate completes a small, scoped project independently over a set period, submitting working code or a d…
Whiteboard Interview
A whiteboard interview is a live technical interview format where a candidate solves a coding or design problem in real time on a whiteboard or shared editor,…
Interview Questions(39)
What is Big O Notation?
Big O notation describes how an algorithm’s running time or memory usage grows as the input size grows, focusing on the dominant term and ignoring constant fac…
Difference Between Array and Linked List
An array stores elements in contiguous memory with fixed-size, index-based access in O(1), while a linked list stores elements as nodes scattered in memory, ea…
What is a Hash Table?
A hash table is a data structure that maps keys to values using a hash function to compute an index into an array of buckets, giving average O(1) insertion, lo…
What is Recursion?
Recursion is a technique where a function solves a problem by calling itself on a smaller instance of the same problem, until it reaches a base case that stops…
Difference Between Stack and Queue
A stack is a LIFO (Last In, First Out) structure where the last element added is the first removed, while a queue is a FIFO (First In, First Out) structure whe…
What is a Binary Search Tree (BST)?
A binary search tree is a binary tree where every node’s left subtree holds smaller keys and its right subtree holds larger keys, enabling search, insertion, a…
What is Dynamic Programming?
Dynamic programming is a technique for solving problems by breaking them into overlapping subproblems and storing each subproblem’s result so it is computed on…
What is a Doubly Linked List?
A doubly linked list is a sequence of nodes where each node stores a value plus pointers to both the next and the previous node, allowing traversal in either d…
What is Binary Search?
Binary search is an algorithm that finds a target value in a sorted collection by repeatedly halving the search range, comparing the target to the middle eleme…
What is a Priority Queue?
A priority queue is an abstract data type where each element has a priority, and the element with the highest (or lowest) priority is always removed first, typ…
What is the Difference Between Time and Space Complexity?
Time complexity measures how the number of operations an algorithm performs grows with input size, while space complexity measures how the memory it needs grow…
What is a Balanced Tree?
A balanced tree is a binary tree structured so the height difference between subtrees at every node stays bounded (typically by a constant like 1), keeping the…
Solve the Two Sum Problem
The optimal solution to Two Sum scans the array once while keeping a hash map of value to index, checking on every element whether its complement (target minus…
What is Kadane's Algorithm?
Kadane's algorithm finds the maximum sum of a contiguous subarray in O(n) time and O(1) space by scanning once and, at each position, deciding whether to exten…
What is the Dutch National Flag Problem?
The Dutch National Flag problem asks you to sort an array containing only three distinct values (classically 0s, 1s, and 2s) into three contiguous groups in a…
How Would You Design an LRU Cache?
An LRU (Least Recently Used) cache is designed by combining a hash map for O(1) key lookup with a doubly linked list that keeps items ordered by recency, so th…
How Do You Solve the Trapping Rain Water Problem?
The Trapping Rain Water problem, given an array of bar heights, is solved optimally with a two-pointer approach in O(n) time and O(1) space: water trapped abov…
How Would You Implement a Stack Using Queues?
A stack (LIFO) can be built from one or two FIFO queues by rotating the queue after every push so the newest element sits at the front, which makes push O(n) a…
How Would You Implement a Queue Using Stacks?
A queue (FIFO) can be built from two stacks: an 'in' stack absorbs every enqueue in O(1), and an 'out' stack is refilled by popping everything off 'in' and pus…
How Would You Design a Min Stack?
A min stack supports push, pop, top, and getMin all in O(1) by maintaining a second, auxiliary stack that tracks the minimum value at each point in the main st…
How Would You Evaluate Reverse Polish Notation?
Reverse Polish Notation (postfix) is evaluated in a single left-to-right pass using a stack: push every number, and whenever an operator is seen, pop its two m…
How Does the Next Permutation Algorithm Work?
The next permutation algorithm rearranges a sequence in place into the lexicographically next greater permutation using O(n) time and O(1) extra space, by find…
How Do You Rotate an Array by K Positions?
The optimal way to rotate an array of n elements right by k positions in place is the three-reversal trick: reverse the whole array, then reverse the first k e…
How Do You Rotate a Matrix 90 Degrees In Place?
To rotate an n x n matrix 90 degrees clockwise in place, first transpose the matrix by swapping element (i, j) with (j, i), then reverse each row, achieving O(…
Showing 24 of 39.