[go: up one dir, main page]
Scribd
Upload
26 views9 pages

DSA Sheet

DSA Sheet for Interview Preparations

Uploaded by

Shashank S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views9 pages

DSA Sheet

DSA Sheet for Interview Preparations

Uploaded by

Shashank S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Day 1:

1. Two Sum
2. Reverse String
3. Move Zeroes

Day 2:

1. Best Time to Buy and Sell Stock


2. Valid Anagram
3. Find All Duplicates in an Array

Day 3:

1. Maximum Subarray
2. Product of Array Except Self
3. Rotate Image

Day 4:

1. Longest Substring Without Repeating Characters


2. Group Anagrams
3. Minimum Window Substring

Day 5:

1. Implement strStr()
2. Valid Parentheses
3. Longest Palindromic Substring

Day 6:

1. Palindromic Substrings
2. Word Search (Recursion/Backtracking)
3. Subarray Sum Equals K

Day 7:

1. Longest Consecutive Sequence


2. Container With Most Water
3. 3Sum

Day 8:

1. Reverse Linked List


2. Merge Two Sorted Lists
3. Linked List Cycle
Day 9:

1. Remove Nth Node From End of List


2. Add Two Numbers
3. Intersection of Two Linked Lists

Day 10:

1. Copy List with Random Pointer


2. LRU Cache
3. Reorder List

Day 11:

1. Merge k Sorted Lists


2. Swap Nodes in Pairs
3. Palindrome Linked List

Day 12:

1. Remove Linked List Elements


2. Odd Even Linked List
3. Reverse Nodes in k-Group

Day 13:

1. Rotate List
2. Partition List
3. Flatten a Multilevel Doubly Linked List

Day 14:

1. Linked List Cycle II


2. Insertion Sort List
3. Sort List

Day 15:

1. Implement Stack using Queues


2. Implement Queue using Stacks
3. Min Stack

Day 16:

1. Evaluate Reverse Polish Notation


2. Valid Parentheses
3. Simplify Path
Day 17:

1. Daily Temperatures
2. Next Greater Element I
3. Next Greater Element II

Day 18:

1. Sliding Window Maximum


2. Design Circular Deque
3. Design Snake Game

Day 19:

1. Design Hit Counter


2. Moving Average from Data Stream
3. Min Stack

Day 20:

1. Basic Calculator
2. Largest Rectangle in Histogram
3. Trapping Rain Water

Day 21:

1. Decode String
2. Remove K Digits
3. Design Front Middle Back Queue

Day 22:

1. Maximum Depth of Binary Tree


2. Symmetric Tree
3. Invert Binary Tree

Day 23:

1. Binary Tree Level Order Traversal


2. Validate Binary Search Tree
3. Path Sum (Recursion/Backtracking)

Day 24:

1. Construct Binary Tree from Preorder and Inorder Traversal


2. Binary Tree Right Side View
3. Kth Smallest Element in a BST
Day 25:

1. Serialize and Deserialize Binary Tree


2. Flatten Binary Tree to Linked List
3. Lowest Common Ancestor of a Binary Tree

Day 26:

1. Sum Root to Leaf Numbers


2. Recover Binary Search Tree
3. Populating Next Right Pointers in Each Node

Day 27:

1. Construct Binary Search Tree from Preorder Traversal


2. Binary Tree Maximum Path Sum
3. Find Leaves of Binary Tree

Day 28:

1. Binary Search Tree Iterator


2. Vertical Order Traversal of a Binary Tree
3. Count Complete Tree Nodes

Day 29:

1. Number of Islands (Recursion/Backtracking)


2. Course Schedule
3. Graph Valid Tree

Day 30:

1. Clone Graph
2. Pacific Atlantic Water Flow (Recursion/Backtracking)
3. Word Ladder

Day 31:

1. Alien Dictionary
2. Reconstruct Itinerary (Recursion/Backtracking)
3. Network Delay Time

Day 32:

1. Critical Connections in a Network


2. Minimum Cost to Connect All Points
3. Redundant Connection
Day 33:

1. Course Schedule II
2. Accounts Merge
3. Word Ladder II (Recursion/Backtracking)

Day 34:

1. Longest Increasing Path in a Matrix (Recursion/Backtracking)


2. Cheapest Flights Within K Stops
3. Swim in Rising Water

Day 35:

1. Is Graph Bipartite?
2. Find Eventual Safe States
3. Smallest String With Swaps

Day 36:

1. Climbing Stairs
2. House Robber
3. Coin Change

Day 37:

1. Longest Increasing Subsequence


2. Word Break
3. Partition Equal Subset Sum

Day 38:

1. Maximum Product Subarray


2. Unique Paths
3. Minimum Path Sum

Day 39:

1. Longest Common Subsequence


2. Edit Distance
3. Burst Balloons

Day 40:

1. Best Time to Buy and Sell Stock with Cooldown


2. Decode Ways
3. Jump Game
Day 41:

1. Interleaving String
2. Palindrome Partitioning (Recursion/Backtracking)
3. Largest Divisible Subset

Day 42:

1. Perfect Squares
2. Target Sum
3. Maximum Length of Pair Chain

Day 43:

1. Jump Game II
2. Gas Station
3. Candy

Day 44:

1. Remove Duplicate Letters


2. Partition Labels
3. Queue Reconstruction by Height

Day 45:

1. Task Scheduler
2. Minimum Number of Arrows to Burst Balloons
3. Non-overlapping Intervals

Day 46:

1. Find the Duplicate Number


2. Split Array into Consecutive Subsequences
3. Merge Intervals

Day 47:

1. Monotone Increasing Digits


2. Jump Game III
3. Minimum Cost to Hire K Workers

Day 48:

1. IPO
2. Reorganize String
3. Minimum Deletion Cost to Avoid Repeating Letters
Day 49:

1. Minimum Moves to Equal Array Elements II


2. Dota2 Senate
3. Task Scheduler II

Day 50:

1. Permutations
2. Combination Sum
3. Subsets

Day 51:

1. N-Queens
2. Sudoku Solver
3. Word Search II

Day 52:

1. Letter Combinations of a Phone Number


2. Palindrome Partitioning
3. Generate Parentheses

Day 53:

1. Knight’s Tour
2. Combination Sum II
3. Restore IP Addresses

Day 54:

1. Permutations II
2. Word Break II
3. Combinations

Day 55:

1. Rat in a Maze
2. Subset Sum
3. Expression Add Operators

Day 56:

1. Partition to K Equal Sum Subsets


2. Combination Sum III
3. Remove Invalid Parentheses
Day 57:

1. Single Number
2. Number of 1 Bits
3. Reverse Bits

Day 58:

1. Power of Two
2. Counting Bits
3. Missing Number

Day 59:

1. Sum of Two Integers


2. Divide Two Integers
3. Subsets II

Day 60:

1. Gray Code
2. Maximum XOR of Two Numbers in an Array
3. Total Hamming Distance

Day 61:

1. Bitwise AND of Numbers Range


2. Bitwise ORs of Subarrays
3. Prime Number of Set Bits in Binary Representation

Day 62:

1. XOR Queries of a Subarray


2. Concatenation of Consecutive Binary Numbers
3. Minimum XOR Sum of Two Arrays

Day 63:

1. Binary Watch
2. Complement of Base 10 Integer
3. Convert Binary Number in a Linked List to Integer

Day 64:

1. Kth Largest Element in an Array


2. Top K Frequent Elements
3. Find Median from Data Stream
Day 65:

1. Find K Closest Elements


2. Task Scheduler
3. Top K Frequent Words

Day 66:

1. Find K Pairs with Smallest Sums


2. Smallest Range Covering Elements from K Lists
3. Kth Smallest Number in Multiplication Table

Day 67:

1. Implement Trie (Prefix Tree)


2. Add and Search Word
3. Replace Words

Day 68:

1. Word Search II
2. Longest Word in Dictionary
3. Design Search Autocomplete System

Day 69:

1. Stream of Characters
2. Short Encoding of Words
3. Maximum XOR of Two Numbers in an Array (using Trie)

You might also like