Skip to main content

9. Question List for Interviews

Notations
  • ⭐️⭐️ - Very important Questions / Must Do
  • ⭐️ - Good one / Should do .
  • 🧑‍💻 Code Again / Do it atleast twice
  • 😈 Done and didnt think that it should be coded
  • Rest - can Skip
  • 🤖 TODO by Shaurya(me)
info
  • These questions are complied from various courses available online.
  • These questions are either mentioned/solved/assigned to/for student to complete.
  • Courses include/from: Youtube(Aditya Verma), CodingBlock, CodingNinjas, Algozenith, CodingMinutes, AppliedAI, ByteByByte and many more...
  • Questions available on PlatForms - Leetcode, Lintcode, Interviewbit, spoj, codechef, CSES...
  • Question lists are sorted lexiographically for easy access/search for a question.

Questions on Linked List​

Done ?Stars: Question + LinkMy Solution
✅Add two numbersMy Solution
✅⭐️⭐️ Add two numbers 2
Follow Up Solution: can do it without
reversing using extra space of 2 stacks.		My Solution
✅⭐️⭐️ Clone a LL with next and random pointerMy Solution
✅Convert SortedLL to BSTMy Solution
✅⭐️ Design LL My Solution
✅Delete node in a LLMy Solution
✅Delete middle Node of LLMy Solution
✅Even ReverseMy Solution
✅Flatten a Multilevel DLLMy Solution
✅⭐️ Intersection of point of two LLMy Solution
✅Insertion sort listMy Solution
✅Kth node from middleMy Solution
🤖Linked list in BTMy Solution
✅⭐️⭐️ LRU cacheMy Solution
✅List cycle
Tip: Inititally, Start slow and fast
from the same point (head).		My Solution
✅⭐️ List cycle 2
Tip: Inititally, Start slow and fast
from the same point (head).		My Solution
✅Proof, FLoyd's Cycle DetectionMy Solution
✅⭐️ Merge k Sorted listsMy Solution
✅Merge 2 sorted listsMy Solution
✅Middle of a linked listMy Solution
✅⭐️⭐️ Next greater NodeMy Solution
✅Odd Even LLMy Solution
✅Palindrome listMy Solution
✅Partition listMy Solution
✅Remove duplicates from sorted listMy Solution
✅Remove duplicates from sorted list IIMy Solution
✅Remove LL elementMy Solution
✅Reverse Nodes in K-groupMy Solution
✅⭐️ Reverse Alternate k nodesMy Solution
✅Reorder listMy Solution
✅Remove nth node from list endMy Solution
✅Rotate a LLMy Solution
🤖Reverse nodes in even length groupsMy Solution
✅Reverse LLMy Solution
✅Reverse LL IIMy Solution
✅⭐️ Sort listMy Solution
✅Sort binary linked listMy Solution
✅Swap list nodes in pairsMy Solution
🤖Split linked list in partsMy Solution
✅See, XOR LL[-]

Questions on Stack​

Done ?Stars: Question + LinkMy Solution
✅Asteroid CollisionMy Solution
✅Daily Temperature[-]
✅Evaluate ExpressionMy Solution
✅❌Design a stack with operations on middle element GFG
✅⭐️⭐️ Largest rectangle in HistogramMy Solution
✅⭐️⭐️ Max Rectangle in Binary sub-Matrix with all 1sMy Solution
🧑‍💻⭐️⭐️ Minimum element in stack with extra space/O(1) spaceMy Solution
🤖Minimum moves to make valid ParenthesesMy Solution
✅⭐️ Next Greater Element
Tip: Traverse from right.		My Solution
✅⭐️ Next Greater Element in Circular
Tip: Traverse from right.		My Solution
✅⭐️ Next Smaller Element
Tip: Traverse from right.		My Solution
✅Prev Smaller Element
Tip: Traverse from left.		My Solution
✅Prev Greater Element/MAXSPPROD
Tip: Traverse from left.		My Solution
✅Reverse a stack using recursionSolution
✅Remove All Adjacent DuplicatesMy Solution
✅Remove All Adjacent Duplicates 2My Solution
🤖Redundant bracesMy SolutionMy Solution
✅Stock spanMy Solution
✅Simplify directory pathMy Solution
✅⭐️ Stack using 2 queue, FollowUp: Using 1 queueMy Solution
✅⭐️⭐️ Trapping Rainwater
1. Using Extra Space(include
current building while calculating lmax/rmax)
2. Using Two Pointer,
Tip: move pointer from the smaller building
(Tip: Why? Use maths)		My Solution
✅Typed out StringsMy Solution
✅Valid parenthesesMy Solution
🤖Longest Valid parenthesesMy Solution

Questions on Queue​

Done ?Stars: Question + LinkMy Solution
🤖Design Circular QueueMy Solution
✅⭐️⭐️First non-repeating character in a stream of charactersMy Solution
✅⭐️⭐️Josephus ProblemMy Solution
✅Queue using stacksMy Solution

Questions on Sliding Window / Deque / Two Pointers​

Done ?Stars: Question + LinkMy Solution
✅⭐️⭐️ Celebrity ProblemMy Solution
✅Container with most waterMy Solution
✅Distinct Number in windowMy Solution
✅⭐️⭐️ Longest Substring without Repeating CharactersMy Solution
✅🧑‍💻Maximum Sliding Window
Hint: Always maintain the max of window at the front of deque.		My Solution
✅⭐️⭐️ Trapping RainwaterDone in Stack Section
https://leetcode.com/problems/maximum-average-subarray-i/
First negative number in every window of size k
Count Occurence of Anagram
Maximum of all subarray of size k
Largest subarray of sum k
Longest Substring with k unique characters
Pick Toys
Sliding window Median
https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/solution/

Questions on Map / Hashing / Two Pointers​

Done ?Stars: Question + LinkMy Solution
✅Contain Duplicates?My Solution
✅Contain Duplicates 2?My Solution
✅⭐️⭐️ Continuous Subarray sumMy Solution
✅⭐️⭐️ First non-repeating character in a stream of characters[Done in Queue Section]
✅Find Subarray with Zero SumMy Solution
✅Find Subarray with Target SumMy Solution
✅Group Anagrams
✅⭐️⭐️ Longest Subarray length in Binary array with diff 1My Solution
✅Longest Subarray length in Binary array with diff 0
✅Largest subarray with Zero SumMy Solution
✅Largest subarray with K SumMy Solution
✅⭐️⭐️ Longest Consecutive SubsequenceMy Solution
✅⭐️⭐️ Longest Substring without Repeating CharactersMy Solution
✅⭐️⭐️ LRU cache[Done in LL Section]
✅Largest PermutationMy Solution
✅🧑‍💻⭐️⭐️ Minimum Window SubstringMy Solution
✅Array Intersection IMy Solution
✅Array Intersection IIMy Solution
✅❌⭐️⭐️ Minimum Size Subarray SumMy Solution
✅❌Pair SumMy Solution
✅❌Two SumMy Solution
✅❌3 SumMy Solution
✅❌4 SumMy Solution

Questions on Heap​

Done ?Leetcode #Stars: Question + LinkMy Solution
✅LC #215⭐️⭐️ kth Largest in array
1.using QuickSelect, 2.using PQ
3. Using PQ of size k(best)		My Solution
✅InterviewBit⭐️⭐️ kth Smallest in arrayLike above Question (LC #215)
✅LC #973K closest points to originMy Solution
✅LC #703Kth largest number in a streamMy Solution
✅LC #347Top k frequent elements/numbersMy Solution
✅LC #692Top k frequent WordsMy Solution
✅LC #451Frequency SortMy Solution
✅LC #767Reorganize StringMy Solution
✅LC #295⭐️⭐️Running MedianMy Solution
✅LC #1167(Premium)/GFGconnect ropes to minimize the costMy Solution
✅LC #(Premium)/GFGsort a k-sorted array(Nearly sorted array)My Solution
✅LC #378Kth smallest in sorted MatixMy Solution
✅🧑‍💻LC #373⭐️⭐️K pairs with the smallest sumMy Solution
LC #264 - Ugly Number II
LC #358 - Rearrange string K distance apart
LC #1439 - Kth smallest sum of a matrix with sorted rows
LC #857 - Minimum cost to hire K workers
LC #621 - Minimum number of CPU (Task scheduler)
LC #871 - Minimum number of Refueling stops
https://www.interviewbit.com/problems/ways-to-Form-max-heap/ [video]https://www.youtube.com/watch?v=cYhAdbnEq8I

Questions on Sorting​

Done ?Stars: Question + LinkMy Solution
✅LC #1985kth largest Int in arrayMy Solution
LC #Wiggle SortMy Solution
LC #Sort array of 0,1,2My Solution
LC #Count 1s in sorted Binary arrayMy Solution
LC #Rotate ImageMy Solution
LC #Inversion CountMy Solution
LC #Wave SortMy Solution

Questions on Bit Manipulation​

Done ?Stars: Question + LinkMy Solution
✅Count Set bits[-]
✅Number after Double Reversal[-]
✅⭐️Power of two[-]
✅⭐️Power of Four[-]
✅Single Number[-]
✅⭐️Single Number II[-]
✅Single Number III[-]
✅Single Number III[-]
✅Counting Bits[-]
✅Maximum Product of word Lengths[-]
✅Hamming Distance[-]
✅Total Hamming Distance[-]
✅Pow(x,n)[-]
✅Xoring the subarrays[-]
Done ?Stars: Question + LinkMy Solution
✅Find Max in Bitonic Array
Tip: move toward peak by checking curr and next element		My Solution
✅⭐️⭐️Find Peak Element
Tip: move toward peak by checking curr and next element		My Solution
✅Find Peak in ArrayMy Solution
First and last pos of elementMy Solution
Aggressive CowsMy Solution
Angry BirdsMy Solution
Book AllocationMy Solution
Painter Problem/Painting partitionMy Solution
Pivot of sorted and Rotated ArrayMy Solution
Find SqrtMy Solution
Search in Rotated Sorted ArrayMy Solution
Minimum in Rotated Sorted ArrayMy Solution
Lonely Element in sorted ArrayMy Solution
Median of Two Sorted ArraysMy Solution
Nth root of a number using binary search
median of row-wise sorted matrix
Median of two sorted arrays if different sizes
kth element of 2 sorted arrays
powerset, print all subsequence

Questions on Tree​

Done ?Stars: Question + LinkMy Solution
✅Average of levelMy Solution
✅Balance BTMy Solution
✅BT from Pre + InMy Solution
✅BT from In + PostMy Solution
✅⭐️BT from Pre + PostMy Solution
✅BST from PreOrderMy Solution
✅Binary tree PathsMy Solution
✅🧑‍💻⭐️⭐️BST to greaterSumTreeMy Solution
✅BT PruningMy Solution
✅Construct string from BTMy Solution
✅⭐️Count Number of subtrees With given SumMy Solution
✅Check Mirror of itselfMy Solution
✅Cousin in BTMy Solution
✅Closest Element in BSTMy Solution
✅Delete in BSTMy Solution
✅Diameter of Binary TreeMy Solution
✅Flatten-binary-tree-to-linked-listMy Solution
✅Get Mirror/Invert of a treeMy Solution
✅🧑‍💻⭐️⭐️ Inorder Successor of BSTMy Solution
✅🧑‍💻⭐️⭐️ Inorder Successor of BTRead given Blog
✅Identical BTsMy Solution
✅Identical BTsMy Solution
✅Identical BTsMy Solution
✅Insert in BSTMy Solution
✅⭐️⭐️ kth Smallest in BSTMy Solution
✅⭐️⭐️ kth Largest in BSTMy Solution
✅Level OrderMy Solution
✅LCA of BT
LCA in tree always O(n).		My Solution
✅LCA of BST
LCA in BST is simplest to calculate than trees?
Yes.(logn in best cases)		My Solution
✅Largest in each rowMy Solution
✅😈Largest BST SubtreeExternal Link
✅⭐️⭐️ Left View of BT
No need of Hashmap,use variable maxLevelSeenSoFar		My Solution
✅Min Depth of BTMy Solution
✅(Max Depth)(Height) of BTMy Solution
✅⭐️⭐️ Max Path sum in BTMy Solution
✅⭐️⭐️ Max Sum BSTMy Solution
✅⭐️⭐️ Maximum Sum possible not taking adjacent in BTMy Solution
✅Merge Two BTsMy Solution
✅🧑‍💻⭐️⭐️ Nodes at Distance K from given node in BTMy Solution
✅Path SumMy Solution
✅Path Sum 2My Solution
✅Reverse Level OrderMy Solution
✅⭐️⭐️ Right View of BT
No need of Hashmap, use variable maxLevelSeenSoFar		My Solution
✅Range Sum of BSTMy Solution
✅🧑‍💻⭐️⭐️Symmetric TreeMy Solution
✅Search in BSTMy Solution
✅Sum of left LeavesMy Solution
✅Sorted Array to BSTMy Solution
✅Validate BSTMy Solution
✅⭐️⭐️ Vertical Order of TreeMy Solution
✅Zigzag of treeMy Solution
Serialize and deserialize BTMy Solution
Serialize and deserialize BSTMy Solution
Serialize and deserialize n-ary-treeMy Solution
Recover BSTMy Solution
Reciver a tree from preorderMy Solution
⭐️⭐️Top View of Binary TreeMy Solution
⭐️⭐️Bottom View of Binary TreeMy Solution
⭐️⭐️Boundary of Binary TreeMy Solution
https://leetcode.com/problems/add-one-row-to-tree/
https://leetcode.com/problems/path-sum-iii/
https://leetcode.com/problems/sum-root-to-leaf-numbers/
print ancestor of given node in tree
Preorder Traversal
Postorder Traversal
Inorder Traversal
Next node in same level of BT
⭐️ find mode in BST
Second Minium node in a binary tree
Two sum in BST [use inorder stack and reverse inorder stack]
https://leetcode.com/problems/deepest-leaves-sum/
https://leetcode.com/problems/all-elements-in-two-binary-search-trees/
https://leetcode.com/problems/count-complete-tree-nodes/
https://leetcode.com/problems/trim-a-binary-search-tree/
https://leetcode.com/problems/minimum-absolute-difference-in-bst/
https://leetcode.com/problems/distribute-coins-in-binary-tree/
https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/
https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/
https://leetcode.com/problems/most-frequent-subtree-sum/
https://leetcode.com/problems/split-bst/
https://leetcode.com/problems/binary-search-tree-iterator/
https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/
https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/
https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/
https://leetcode.com/problems/minimum-distance-between-bst-nodes/
https://leetcode.com/problems/sum-of-distances-in-tree/
Max element b/w two nodes
BT shortes distance b.w nodes
Check if two N-ary trees are Mirror image or not
Special tree
big bang theory tree
Total subtrees with given sum
Vertical sum of Binary Tree
Inorder Tree Traversal without recursion and without stack (Threaded binary tree)
Print Common Nodes in two BSTs
Ancestor in a BST
Pair Sum in BST
Floor in BST
[ ] Upper bound in BST
Merge two BSTs
Smaller on Right
Fixing Two nodes of a BST
Determine if Two Trees are Identical
Children Sum Parent
Maximum Width of Tree
Ancestor in a Binary Tree
Vertical Width of a Binary Tree
Make Binary Tree From Linked List
Construct Binary Tree from Parent Array
Foldable Binary Tree
Children Sum Property
Burn a Binary Tree from a Leaf
We are given a binary tree and a leaf node, we need to find time to burn the Binary Tree if we burn the given leaf at 0-th second.
Given a Binary Tree and a Key. The task is to insert the key into the binary tree at first position available in level order.
Inorder Traversal (with recursion and without recursion)
Preorder Traversal (with recursion and without recursion)
Postorder Traversal (with recursion and without recursion)
LeftView Of Binary Tree
Bottom View of Binary Tree
Top View of Binary TreeDay18: (Binary Tree)
Level order Traversal / Level order traversal in spiral Form
Height of a Binary Tree
Diameter of Binary Tree
Check if Binary tree is height balanced or not
LCA in Binary Tree
Check if two trees are identical or not
Maximum path sum
Construct Binary Tree from inorder and preorder
Construct Binary Tree from Inorder and Postorder
Symmetric Binary Tree
Flatten Binary Tree to LinkedList
Check if Binary Tree is mirror of itself or not
Populate Next Right pointers of Tree
Search given Key in BST
Construct BST from given keys.
Check is a BT is BST or not
Find LCA of two nodes in BST
Find the inorder predecessor/successor of a given Key in BST.
Floor and Ceil in a BST
Find K-th smallest and K-th largest element in BST (2 different Questions)
Find a pair with a given sum in BST
BST iterator
Size of the largest BST in a Binary Tree
Binary Tree to Double Linked List
Find median in a stream of running integers.
K-th largest element in a stream.
Distinct numbers in Window.
K-th largest element in an unsorted array.
Flood-fill Algorithm

Questions on Recursion, Backtracking​

Done ?Stars: Question + LinkMy Solution
✅SubsetsMy Solution
✅⭐️⭐️Subsets II
Do without using set to store all subsets		My Solution
✅Sudoku SolverMy Solution
✅N QueensMy Solution
✅N Queens 2My Solution
✅Generate ParenthesisMy Solution
✅CombinationsMy Solution
✅Combination Sum 1My Solution
✅⭐️⭐️Combination Sum 2My Solution
✅⭐️⭐️Combination Sum 3My Solution
✅PermuatationsMy Solution
✅⭐️⭐️Permuatations IIMy Solution
✅Unique BST 2My Solution
✅⭐️⭐️Palindromic PartitionMy Solution
✅Palindrome SubstringMy Solution
✅Letter Combinations of a Phone Number/ Keypad ProblemMy Solution
✅Decode WaysMy Solution
Decode ways 2My Solution
generate-all-parentheses-iiMy Solution
✅different-ways-to-add-parentheses
word-searchMy Solution
gray-code/My Solution
kth-permutation-sequence/My Solution
strobogrammatic-number-iiMy Solution
strobogrammatic-number-iiiMy Solution
special-binary-stringMy Solution
all-possible-full-binary-treesMy Solution
restore-ip-addressesMy Solution
count-numbers-with-unique-digitsMy Solution
additive-numberMy Solution
permutation-sequenceMy Solution
number-of-squareful-arraysMy Solution
stickers-to-spell-wordMy Solution
path-with-maximum-goldMy Solution
problems/KOL1510My Solution
problems/LPARTYMy Solution
problem/320/AMy Solution
contest/1006/problem/FMy Solution
partition-to-k-equal-sum-subsetsMy Solution
k-th-symbol-in-grammarMy Solution
✅Word Break
can be memoized + Trie can be used		My Solution
✅Word Break 2
can be memoized + Trie can be used		My Solution
[ ] find the largest rectangle containing 1 in binary matrix
[ ] Knight Walk in Chess
[ ] Rat in a maze
[ ] all substring
[ ] M-coloring
[ ] https://www.geeksforgeeks.org/problems/knight-walk4521/1

Questions on DP​

Done ?Stars: Question + LinkDP FormMy Solution
✅Climbing Stairsdp(i), Form 1[-]
✅Min Cost Climbing Stairsdp(i), Form 1[-]
✅Knapsackdp(i, X), Form 1[-]
✅⭐️⭐️Colourful Brickdp(i, X), Form 1[-]
✅⭐️⭐️Colourful Knapsackdp(i, X), Form 1My Solution
✅⭐️⭐️Google Platesdp(i, X), Form 1My Solution
✅Partition Array for Maximum Sumdp(i), Form 1[-]
✅⭐️⭐️Partition Equal Subset Sumdp(i), Form 1[-]
✅⭐️House Robberdp(i) Form 1/2[-]
✅⭐️House Robber 2dp(i) Form 1/2[-]
✅Advance Tilling Problemdp(i), Form 2 Best Explaination[-]
✅Min. Round to Complete All tasksDP or Greedy, dp(i) Form 2[-]
✅⭐️⭐️Advance Tilling Problem 2dp(i), Form 2[-]
✅Unique BSTsdp(i) Form 2[-]
✅Palindrome Substringdp(i) Form 2[-]
✅⭐️⭐️Palindromic Partition 2dp(i) Form 2[-]
✅⭐️⭐️Palindromic Partition 3dp(l) Form 2[-]
✅⭐️⭐️Palindromic Partition 4dp(l) Form 2[-]
✅⭐️⭐️Edit Distancedp(i, j), Form 3[-]
✅⭐️⭐️Wild Card Matchingdp(i, j), Form 3,
Tip: convert O(N) to O(1) Transitions		[-]
✅Delete op. for Two Stringdp(i, j) Form 3[-]
✅⭐️⭐️Interleaving Stringsdp(i, j, k), Form 3[-]
✅Min Insertion to make it palindromedp(i, j), Form 3[-]
✅⭐️⭐️Longest Palindrome Subsequencesdp(l, r), Form 4[-]
✅⭐️⭐️Longest Palindrome Substringseems like Form 4[-]
✅Predict the Winnerdp(l, r) Form 4[-]
✅⭐️⭐️Scrambled Stringdp(l, r) Form 4[-]
✅⭐️⭐️Merge Element 1dp(l, r) Form 4[-]
🤖⭐️⭐️Merge Element 2dp(l, r) Form 4[-]
✅⭐️⭐️Combination Sum 4My Solution
✅⭐️⭐️Longest Common Subsquence of 2 stringsdp(i, j), Form 3[-]
✅⭐️⭐️Longest Common Subsquence of 3 stringsdp(i, j, k) Form 3[-]
✅⭐️⭐️Shortest Common Supersequencedp(i, j), Form 3[-]
⭐️⭐️K-Ordered LCSdp(i, j) Form 3[-]
  • Minimum Falling Path Sum
  • Coin Change Problem Name: K-Ordered LCS Problem Difficulty: None Problem Constraints: 1 <= N, M <= 2000 1 <= k <= 5 1 <= element in any sequence <= 109 Problem Description: Any programmer worth his salt would be familiar with the famous Longest Common Subsequence problem. Mancunian was asked to solve the same by an incompetent programmer. As expected, he solved it in a flash. To complicate matters, a twist was introduced in the problem.

In addition to the two sequences, an additional parameter k was introduced. A k-ordered LCS is defined to be the LCS of two sequences if you are allowed to change atmost k elements in the first sequence to any value you wish to. Can you help Mancunian solve this version of the classical problem?

Input Format: The first line contains three integers N, M and k, denoting the lengths of the first and second sequences and the value of the provided parameter respectively. The second line contains N integers denoting the elements of the first sequence. The third line contains M integers denoting the elements of the second sequence. Sample Input: 5 5 1 1 2 3 4 5 5 3 1 4 2 Output Format: Print the answer in a new line. Sample Output: 3

| | ⭐️⭐️Longest Common Substring | dp(ending at i, j) Form 2 + 3 | [-] | | | ⭐️⭐️Regular Expression Matching | | [-] |

Questions on Graphs​

Done ?Stars: Question + LinkMy Solution
✅Jump Game IV[-]
✅Maximal Network Rank[-]
✅Minimum degree of Connected Trio[-]
✅Snakes and Ladders[-]
✅[-]
✅Word Ladder[-]
✅Word Ladder 2[-]
✅Network Delay time
Dijkstra's Algo		[-]
✅Keys and Rooms[-]
✅Max Area of Island[-]
✅Journey to the Moon[-]
✅Rotten Oranges[-]
✅Walls and Gates[-]
✅Time Need to inForm All employees[-]
✅Course Schedule[-]
✅Min cost to Climbing Stairs[-]
✅Knight Prob. in Chessboard[-]
✅Number of Island[-]
😈Walls and GatesVideo

Questions on Trie​

Done ?Stars: Question + LinkMy Solution
✅Longest Common PrefixMy Solution
✅Implement Prefix TrieMy Solution

Questions on Daily challenges​

TODO

Questions on Arrays​

Done ?Stars: Question + LinkMy Solution
✅Missing Number
✅https://leetcode.com/problems/majority-element/
use one candidate and one count variable
✅https://leetcode.com/problems/majority-element-ii/
use two candidates and two count variables
✅https://leetcode.com/problems/rotate-array/
✅https://leetcode.com/problems/move-zeroes/
✅https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/
✅https://leetcode.com/problems/diagonal-traverse/
✅⭐️ https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
✅⭐️ https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
✅⭐️ https://leetcode.com/problems/maximum-difference-between-increasing-elements/
✅https://leetcode.com/problems/summary-ranges/
✅⭐️⭐️ Maximum Product Subarray
✅https://leetcode.com/problems/find-k-closest-elements/
✅⭐️⭐️ https://leetcode.com/problems/first-missing-positive/
✅https://leetcode.com/problems/compare-version-numbers/
✅https://leetcode.com/problems/happy-number/
✅https://www.codechef.com/problems/DIVSUBS

Questions on Strings​

Done ?Stars: Question + LinkMy Solution

  • https://leetcode.com/problems/reverse-words-in-a-string/

  • https://leetcode.com/problems/largest-number/

  • https://leetcode.com/problems/string-compression/

  • Largest subarray sum circular

  • Largest bitonic subarray sum

  • Rotate Array

  • Sort array with 0 and 1

  • Median of 2 sorted Array

  • Count Subarrays with distinct elements

  • Parity of a word

  • Merge 2 sorted lists

  • Even odd Merge

  • Queus with MAX API

  • Height Balanced Tee

  • Implement Stack using Heaps

  • Seach in 2d Matrix

  • Kth Largest element in stream./array

  • Intersection of 2 sorted Array

  • OOPS: Movie Theater

  • Databsea: Healthcare group

  • System Design

  • Convert sorted list to Bnary Search tree

  • Maxiumum path in a trianlge

  • Max sum without adjacent Elements

  • Weighted INretval Scheduling

  • Deadlock Detection

  • Random Play List

  • Frsirst non-repecting char in strma.string

  • First missing positive

  • set mAtrix Zeros

  • Counting inversions

  • Print Nth node Form end of LL

  • Nth row o f Pacscal triangel

  • Rightmost nodes at each level in a tree

  • Nth Fibonacci Number

  • reverse pairs

  • grid unique path

  • find duplicate number

  • set matrix zeros

  • pascal triangle

  • count inversions in array

  • rotate image

  • longest consecutive sequence

  • count subarray with xor as K

  • longest substring without reapeating characters

  • remove duplicated from sorted array

  • Max-consecutive ones

  • N-meeting in One room

  • search in 2d matrix

  • powxn

  • find missing number and repeating number

  • find missing and duplicate number in anrray

  • swap sort(find missing and duplicate number in anrray)

  • find all duplicae and msisin numbers from 1 to N

Questions on Greedy​

Done ?Stars: Question + LinkMy Solution
✅Fractional Knapsack
✅⭐️⭐️Maximum Units on Truck[-]
✅DEFKINSolution
✅⭐️⭐️ChopsticksSolution
✅Merge Intervals[-]
Partition Labels
Map it using Merge Intervals Question		[-]
✅Find Original Array from doubled Array
[-]

https://www.spoj.com/problems/EXPEDI/

Meeting rooms

Questions on Resources​

Questions on TODOS​

https://leetcode.com/problems/longest-mountain-in-array/ https://practice.geeksforgeeks.org/problems/deee0e8cf9910e7219f663c18d6d640ea0b87f87/1 https://practice.geeksforgeeks.org/problems/brackets-in-matrix-chain-multiplication1024/1 https://practice.geeksforgeeks.org/problems/phone-directory4628/1 https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1 https://practice.geeksforgeeks.org/problems/count-ways-to-nth-stairorder-does-not-matter1322/1 https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1 https://practice.geeksforgeeks.org/problems/is-sudoku-valid4820/1 https://practice.geeksforgeeks.org/problems/nuts-and-bolts-problem0431/1 https://practice.geeksforgeeks.org/problems/serialize-and-deserialize-a-binary-tree/1 https://practice.geeksforgeeks.org/problems/column-name-from-a-given-column-number4244/1 https://leetcode.com/problems/rotting-oranges/ https://practice.geeksforgeeks.org/problems/burning-tree/1 https://practice.geeksforgeeks.org/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/1 https://practice.geeksforgeeks.org/problems/print-anagrams-together/1 https://practice.geeksforgeeks.org/problems/overlapping-rectangles1924/1 https://practice.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/1 https://practice.geeksforgeeks.org/problems/run-length-encoding/1 https://practice.geeksforgeeks.org/problems/ugly-numbers2254/1 https://leetcode.com/problems/greatest-common-divisor-of-strings/ https://www.geeksforgeeks.org/distributing-m-items-circle-size-n-starting-k-th-position/ https://practice.geeksforgeeks.org/problems/total-decoding-messages1235/1 https://practice.geeksforgeeks.org/problems/number-following-a-pattern3126/1 https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1 https://practice.geeksforgeeks.org/problems/squares-in-nn-chessboard1801/1 https://practice.geeksforgeeks.org/problems/decode-the-string2444/1 https://leetcode.com/problems/minimum-size-subarray-sum/ https://practice.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem3257/1

Questions on Questions ?​

  • How to showcase soft skills (Teamwork,Leadership skills, Adaptability, DecisionMaking etc) in interview
  • Amazon 14 Leadership Principal with examples
  • How you will resolve conflict with team members in project
  • How you handle situation, when you failed to deliver the project within project estimation timeline
  • Biggest Technical mistake you have done in your project
  • Situation when you had solved a very difficult problem in project
  • Why your CGPA is not high, When you have taken initiative in a project
  • Time when you have failed to meet customer deadline in project
  • What is your greatest achievement in a project
  • Time when you successfully meet the tight deadline of a project
  • Tell me the time when you regret your decision in a project deliverables

Questions List​

Tip: Revise Problems in a 5 day interval by solving it with the most efficient Approach. Interviewer are suppose to ask 2 problems in 45min-1hr. Think aloud.

Questions on Byte by Byte​

  • The #1 reason why people fail interviews is lack of confidence!

    • Nervousness == Lack of confidence
    • Forgetting stuff == Lack of confidence
    • Memorizing == Lack of confidence

  • 3 pillars of Interviewing along with consistent Practise:

    • CS Fundamentals
    • Problem Solving Strategy
    • Self Confidence

  • Turn your interview into a repeatable system.

  • 6 step system for solving any coding interview question, even if I’ve never seen it before

  • prematurely optimizing our code actually hurts us more than it helps

  • The 3 “hail mary” strategies to use when you’re really stuck

  • How to avoid your mind going blank when facing a hard problem

  • "go to interview thinking you are the answer to their problem.” - George Clooney

  • The best interviewees are good at problem-solving. Not pattern recognition

  • treat each hint as a small deduction because They may be trying to guide you away from common pitfalls

  • impostor syndrome: Everyone is way better/smarter than me.

  • If you practice hard problems, then your interview will be easy by comparison

  • You don’t know if you’re ready or not until you try

  • If you mess up, you can always interview again in the future

  • Brainstorm edge cases at the beginning and define assumptions

  • What are the goals of practicing? - ○ Simulate real-world interview - ○ Identify and improve weaknesses - ○ Become comfortable with the tools and systems - ○ Avoid Rehashing what you’re already good at

  • Simulate real-world interview

  • ● Handwrite code

  • ● Talk out loud as you go

  • ● Test your code by hand

  • ● Apply the strategies

    1. Understand the problem [3-5 minutes]

  • Make sure that you really know what is being asked. Take your time here.

  • Go through the example inputs and outputs. How does the input get that output?

    1. Find a brute force solution [5 minutes]
    1. Optimize your solution [15 minutes]
    1. Code your solution [15 minutes]

  • When you get to coding, it should just be “translating” the work you’ve already done

    1. Test your solution [5 minutes]

  • Your interviewer wants to help you

    • ○ The toughest interviews are when I try to help someone and they won’t let me. Don’t try to prove yourself
    • ● Only your interviewer really knows what they are looking for
    • ● It’s an easy way to get them to like you

  • Interview practice

    • ○ Pramp
    • ○ Gainlo
    • ○ Interviewing.io

  • Other practice

    • ○ Toastmasters
    • ○ Wedding toasts
    • ○ Video yourself
    • ○ Actual interviews
After a week or two (if they don’t email)
Reply to the previous email:
Hey FIRSTNAME -
Hope all is well with you. I hadn’t heard back from you so I just wanted to check in and see if there was any more progress on my interview feedback.
Thanks!
Just wanted to bump this up in your inbox in case you missed it. Would love to discuss X.

  • Research the company

  • Prepare a short description of each major project

  • How to structure your answers

    • ● The STAR technique
      • ● Situation (1-2 sentences)
      • ● Task (1 sentence)
      • ● Action (3-5 sentences)
      • ● Result (3-5 sentences)

Questions on Referral​

  • Ask what works they do. means know their work
  • STAR Method
    • Situation -What Happended?
    • Task - What was your job?
    • Action - what did you do?
    • Result - So what?

Questions on Other Tips​

  • Do Time Management -> based on the score of questions
  • Problem Statement
  • Input
  • Output
  • Explanation (optional/maybe given, maybe not)
  • Constraints

Other​

Advance DS​

sad on Questions​