Decode Batch Java
Introductory Session
DSA Roadmap: [Link]
167. Two Sum II - Input Array Is Sorted: [Link]
array-is-sorted/submissions/1473431056/
11. Container With Most Water: [Link]
water/submissions/1473458005
Arrays Problem Solving
26. Remove Duplicates from Sorted Array: [Link]
duplicates-from-sorted-array/submissions/1485378525/
80. Remove Duplicates from Sorted Array II: [Link]
duplicates-from-sorted-array-ii/submissions/1485387223/
121. Best Time to Buy and Sell Stock: [Link]
sell-stock/submissions/1485400246/
122. Best Time to Buy and Sell Stock II: [Link]
and-sell-stock-ii/submissions/1485406495/
55. Jump Game: [Link]
String Problem Solving
28. Find the Index of the First Occurrence in a String: [Link]
the-index-of-the-first-occurrence-in-a-string/submissions/1491594004/
58. Length of Last Word:
[Link]
345. Reverse Vowels of a String:
[Link]
151. Reverse Words in a String:
[Link]
14. Longest Common Prefix:
[Link]
Greedy/Hashing Problem Solving
1. Two Sum: [Link]
242. Valid Anagram (Using sorting):
[Link]
242. Valid Anagram (Using hashing):
[Link]
169. Majority Element: [Link]
73. Set Matrix Zeroes:
[Link]
Anagram Palindrome: [Link]
palindrome4720/1
3. Longest Substring Without Repeating Characters: [Link]
substring-without-repeating-characters/submissions/1497270944/
49. Group Anagrams: [Link]
Binary Search Problem Solving
704. Binary Search:
[Link]
35. Search Insert Position:
[Link]
34. Find First and Last Position of Element in Sorted Array:
[Link]
submissions/1506124402/
74. Search a 2D Matrix:
[Link]
69. Sqrt(x): [Link]
852. Peak Index in a Mountain Array: [Link]
mountain-array/description/
33. Search in Rotated Sorted Array: [Link]
sorted-array/description/
Aggressive Cows: [Link]
Code: [Link]
Bit Manipulation Problem Solving
Bitwise and Shift Operators: [Link]
operators
191. Number of 1 Bits:
[Link]
268. Missing Number:
[Link]
136. Single Number:
[Link]
190. Reverse Bits: [Link]
Time and Space Complexity
Time Complexity: [Link]
Asymptotic Analysis: [Link]
Time Complexity Chart: [Link]
chart/
Understanding Space Complexity: [Link]
Trick questions from Time & Space Complexity:
[Link]
PPT: [Link]
usp=sharing
Recursion
Java Recursion: [Link]
Print 1 to n using recursion: [Link]
Print in reverse using recursion:
[Link]
Factorial: [Link]
509. Fibonacci Number:
[Link]
1137. N-th Tribonacci Number:
[Link]
231. Power of Two using loop:
[Link]
Using recursion: [Link]
50. Pow(x, n): [Link]
Linked List
Introduction: [Link]
876. Middle of the Linked List:
[Link]
876. Middle of the Linked List using Fast/Slow pointer:
[Link]
83. Remove Duplicates from Sorted List: [Link]
from-sorted-list/submissions/1534802743
19. Remove Nth Node From End of List: [Link]
from-end-of-list/description
206. Reverse Linked List:
[Link]
61. Rotate List: [Link]
Stack
Java Stack Class: [Link]
344. Reverse String:
[Link]
20. Valid Parentheses:
[Link]
503. Next Greater Element II:
[Link]
496. Next Greater Element I:
[Link]
1910. Remove All Occurrences of a Substring: [Link]
occurrences-of-a-substring/description/
Queue
Introduction: [Link]
232. Implement Queue using Stacks: [Link]
using-stacks/submissions/1548597589
225. Implement Stack using Queues: [Link]
queues/description
Types of Queues: [Link]
Deque: [Link]
Circular Queue: [Link]
Binary Tree
Tree Data Structure: [Link]
Binary Tree: [Link]
Full Binary Tree: [Link]
Perfect Binary Tree: [Link]
Complete Binary Tree: [Link]
Balanced Binary Tree: [Link]
Tree Traversal - inorder, preorder and postorder: [Link]
traversal
144. Binary Tree Preorder Traversal: [Link]
traversal/submissions/1559099093/
145. Binary Tree Postorder Traversal: [Link]
traversal/submissions/1559107733/
94. Binary Tree Inorder Traversal: [Link]
traversal/submissions/1559109470/
102. Binary Tree Level Order Traversal: [Link]
order-traversal/submissions/1559114787/
Practice Binary Tree
104. Maximum Depth of Binary Tree: [Link]
binary-tree/submissions/1567747321/
111. Minimum Depth of Binary Tree: [Link]
binary-tree/description/
110. Balanced Binary Tree:
[Link]
993. Cousins in Binary Tree:
[Link]
236. Lowest Common Ancestor of a Binary Tree: [Link]
common-ancestor-of-a-binary-tree/description/
103. Binary Tree Zigzag Level Order Traversal: [Link]
zigzag-level-order-traversal/description
199. Binary Tree Right Side View: [Link]
view/description/
Problem Solving
6. Zigzag Conversion:
[Link]
Java Collections Framework: [Link]
122. Best Time to Buy and Sell Stock II: [Link]
and-sell-stock-ii/submissions/1590118396/
121. Best Time to Buy and Sell Stock: [Link]
sell-stock/description/
20. Valid Parentheses: [Link]
169. Majority Element:
[Link]
Binary Search Tree
Binary Search Tree(BST): [Link]
700. Search in a Binary Search Tree: [Link]
search-tree/submissions/1598449073/
701. Insert into a Binary Search Tree: [Link]
search-tree/submissions/1598471892/
450. Delete Node in a BST:
[Link]
98. Validate Binary Search Tree: [Link]
tree/submissions/1598502832/
230. Kth Smallest Element in a BST: [Link]
a-bst/description/
653. Two Sum IV - Input is a BST:
[Link]
Tree Problem Solving
112. Path Sum: [Link]
113. Path Sum II: [Link]
437. Path Sum III: [Link]
129. Sum Root to Leaf Numbers: [Link]
numbers/submissions/1605572989/
7. Reverse Integer:
[Link]
202. Happy Number:
[Link]
Dynamic Programming
Introduction to Dynamic Programming: [Link]
programming
Memoization vs Tabulation: [Link]
tabulation-in-dp-4ff137da8044
509. Fibonacci Number using recursion:
[Link]
509. Fibonacci Number using memoisation: [Link]
number/submissions/1611429609/
509. Fibonacci Number using tabulation: [Link]
number/submissions/1611452670/
509. Fibonacci Number using tabulation space optimised:
[Link]
DP One Shot Video: [Link]
70. Climbing Stairs: [Link]