Homepage Prepare For Coding Interview
Featured Post
Latest Posts
Merge Two Sorted Lists
Clarify the problem: The problem requires merging two sorted linked lists into a single sorted linked list. We need to return the head of ...
Best Time to Buy and Sell Stock
Clarify the problem: The problem requires finding the maximum profit that can be achieved by buying and selling a stock. We can only make on...
Valid Palindrome
Clarify the problem: The problem requires determining whether a given string is a valid palindrome. A palindrome is a string that reads th...
Invert Binary Tree
Clarify the problem: The problem requires inverting a binary tree. Given the root of a binary tree, we need to swap the left and right chi...
Valid Anagram
Clarify the problem: The problem requires determining whether two strings are anagrams of each other. An anagram is a word or phrase forme...
Binary Search
Clarify the problem: The problem requires implementing the binary search algorithm to find a target element in a sorted array. We are give...
Flood Fill
Clarify the problem: The problem requires implementing a flood fill algorithm to fill a given area with a new color. We are given an image...
Lowest Common Ancestor of a Binary Search Tree
Clarify the problem: The problem requires finding the lowest common ancestor (LCA) of two nodes in a binary search tree (BST). We need to ...
Balanced Binary Tree
Clarify the problem: The problem requires determining whether a binary tree is balanced. We need to check if the heights of the left and r...
Linked List Cycle
Clarify the problem: The problem requires determining whether a linked list contains a cycle. We need to identify if there is a cycle in t...
Implement Queue using Stacks
Clarify the problem: The problem requires implementing a queue using stacks. We need to implement the functionality of a queue, including ...
First Bad Version
Clarify the problem: The problem requires finding the first bad version in a series of versions. We need to implement a function that take...
Ransom Note
Clarify the problem: The problem requires determining if a ransom note can be constructed from a given magazine. We need to implement a fu...
Climbing Stairs
Clarify the problem: The problem requires finding the number of distinct ways to climb to the top of a staircase with n steps. Each time, ...
DIFFICULTY
Data Structures
- Arrays
- Binary Tree
- Avl Tree
- Basic Binary Tree
- Binary Search Tree
- Binary Search Tree Recursive
- Binary Tree Mirror
- Binary Tree Node Sum
- Binary Tree Path Sum
- Binary Tree Traversals
- Diff Views Of Binary Tree
- Distribute Coins
- Fenwick Tree
- Inorder Tree Traversal
- Is Bst
- Lazy Segment Tree
- Lowest Common Ancestor
- Maximum Fenwick Tree
- Merge Two Binary Trees
- Non Recursive Segment Tree
- Number Of Possible Binary Trees
- Red Black Tree
- Segment Tree
- Treap
- Wavelet Tree
- Disjoint Set
- Hashing
- Heap
- Linked List
- Circular Linked List
- Deque Doubly
- Doubly Linked List
- Merge Two Lists
- Middle Element Of Linked List
- Print Reverse
- From Sequence
- Is Palindrome
- Singly Linked List
- Skip List
- Swap Nodes
- Queue
- Circular Queue
- Circular Queue Linked List
- Double Ended Queue
- Linked Queue
- Priority Queue Using List
- Queue By Two Stacks
- Queue On List
- Queue On Pseudo Stack
- Stacks
- Balanced Parentheses
- Dijkstras Two Stack Algorithm
- Evaluate Postfix Notations
- Infix To Postfix Conversion
- Infix To Prefix Conversion
- Next Greater Element
- Postfix Evaluation
- Prefix Evaluation
- Stacks
- Stack With Doubly Linked List
- Stack With Singly Linked List
- Stock Span Problem
- Trie