📕
FAANG Interview Preparation
CtrlK
  • Preparation Notes
  • 🧑‍💻Technology
    • Backend Communication
      • Request Response
    • Kafka
      • Kafka Design
      • Spring Boot Kafka
      • Some Important Configs
      • Offset Policy
      • Optimize the performance of the poll loop in Kafka Consumer
      • Commit in Kafka
      • Durability in Kafka
      • Delivery Semantics
        • Delivery Semantics - Confluent
      • Transactions in Kafka
        • Transactions in Apache Kafka
        • Kafka Exactly Once
      • Retries in Kafka
        • Kafka Producer Retries
    • Databases
    • Operating Systems
  • Distributed Systems and System Design
    • Distributed locking
      • Distributed Locking With Redis in Spring Boot
  • Group 1
    • Page 1
  • ☕java
    • Java Virtual Machine Architecture
    • Garbage Collection in Java
    • JMX Beans
      • JMX Beans
    • Collections to be learned
    • Internals of HashMap
    • Reflection
    • Static vs Non Static variables
    • JPA, ORM and Hibernate ORM
      • Understanding the Key Differences: JPA vs Hibernate-ORM in Java Applications
    • Parallel and Async Processing in JAVA
      • Java Executor Service and Thread Pool
      • Java parallel programming utilizating multiple cores
    • Semaphores in Java
    • Optionals
    • Streams
    • Records
    • Singleton with Reflection Proof
  • DSA interview format
  • Mega Bookmarks
  • Google Interview approach
  • CheatSheet
  • Initial notes on DSA
  • Get Well Prepared for Google Interview
  • Maths
    • Page 1
  • Concepts
    • Permutation, Combination and Subset
    • Subarray, Subsequence and Subset
    • Floor and Ceiling of number
    • Modulo Congurence
    • Arrays and their sorted orders
  • Quirks
    • Getting Character as a numeric value
    • Comparator in Java
    • Bookmarks
  • Arrays and Strings
    • Prefix Sum
      • Longest Sub-Array with Sum K
      • Continuous Subarray Sum
      • Sub Array Sum Divisible by K
      • 🆗Subarray sum equals k
    • Sliding Window
      • Fixed Sliding Window
      • Subarrays with K Different Integers
    • Monotonic Stack
      • Find next greater indexes
      • Next Greater Element 1
      • Next Greater Element 2
      • Daily Temperatures
      • 💰Buildings With an Ocean View
      • 132 pattern
      • Remove K digits
    • Cyclic Sort
      • Concept
    • Two Pointers
      • Running from both ends of an array
      • Slow and Fast Pointers
      • Running from beginning of 2 arrays / Merging 2 arrays
      • Split & Merge of an array / Divide & Conquer
    • TODO: Next Greater permutation
  • Linked Lists
    • Bookmarks
    • Types of Logics to solve Linked Lists
    • Singly Linked List
      • Cycle Detection
      • Problems
      • 😶LFU Cache
      • 😶LRU Cache
      • 😐Reverse Linked List
      • 😭Design Phone Directory
    • Circular LinkedList
      • 😐Insert into a Sorted Circular Linked List
    • Doubly Linked List
  • Binary Search
    • Core Concept
    • Bookmarks
    • Template
    • Problems
      • Search Insert Position
      • Mountain Array
      • Ceiling - 744. Find Smallest Letter Greater Than Target
      • Find First and Last Position of Element in Sorted Array
      • Find position of an element in infinite array
  • 🔙Backtracking
    • Bookmarks
  • Greedy
    • Bookmarks
    • Problems
  • Trees
    • Bookmarks
    • Important Concepts
    • Depth First Search (DFS)
      • Pre Order Traversal
      • InOrder Traversal
      • Post Order Traversal
    • Breadth First Search (BFS)
    • Binary Trees
      • Binary Tree Views
        • Top View
        • Bottom View
        • Left Side View
        • Right Side View
        • Boundary View
      • Lowest Common Ancestor
      • Construct Binary Tree based on inorder and preorder
      • Construct Binary Tree based on inorder and postorder
    • Binary Search Trees
      • Validating BST
      • Searching BST
      • Inserting Node in BST
      • Deleting Node in BST
      • Inorder Successor of BST
      • Inorder Successor of BST with duplicate values
      • LCA for BST
      • Recover BST
      • Sum of deepest leaves node
      • Convert sorted array into BST
      • Convert Sorted Linked List to BST
    • Tries
      • Commonly Used techniques
    • Segment Trees
  • Graphs
    • Core Concept
    • Bookmarks
    • Representation of graphs
    • Breadth First Search
      • Walls and Gates
    • Depth First Search
      • Number of Islands
    • Disjoint Sets - Union Find (Connected Components)
      • Number of Islands II
      • Process Restricted Friend Requests
    • Cycle in Graph
      • Graph Valid Tree
    • Topological Sort
      • Course Schedule
      • Course Schedule II
      • All Ancestors of a Node in a Directed Acyclic Graph
    • Bipartite Graph
      • Is Graph Bipartite?
      • Possible Bipartition
    • Grid Coloring / Flood Fill
    • Shortest Path
  • Intervals
  • Heap/Priority Queue
    • Core Concept
    • Implementation
      • Min Heap
      • Max Heap
    • Bookmarks
    • Time and Space complexities for common operations in Heap
    • Scheduling
    • Top "K" Elements
      • Kth Largest Element in an Array
    • Meeting Rooms
    • Merge Interval
  • Dynamic Programming
    • Bookmarks
    • 2D - DP
      • 62. Finding Unique Path
      • 63. Unique Paths II
      • Ninja Training
    • 1D - Dynamic Programming
      • General Approach
      • 70. Climbing Stairs
      • Frog Jump - Coding Ninjas
    • DP for Beginners [Problems | Patterns | Sample Solutions]
    • Patterns in DP
    • All DP problems with categorization
    • Buy and Sell Stock
    • KnapSack
    • String DP
  • Design Patterns
    • Bookmarks
  • System Design
    • Back of the envelope estimation
  • DSA Problems
    • Template
    • 863. All Nodes Distance K in Binary Tree
    • 2096. Step-By-Step Directions From a Binary Tree Node to Another
    • 2415. Reverse Odd Levels of Binary Tree
    • TODO: 987. Vertical Order Traversal of a Binary Tree
    • TODO: 545. Boundary of Binary Tree
    • TODO: 103. Binary Tree Zigzag Level Order Traversal
    • TODO: 100. Same Tree
    • TODO: 543. Diameter of Binary Tree
    • TODO: 104. Maximum Depth of Binary Tree
    • TODO: 110. Balanced Binary Tree
    • CN: Number of rotations in sorted array
    • CN: Implement upper bound
    • CN: Implement Lower Bound
    • CN: Difference of subset sums is minimum
    • CN: Subset Sum Equal To K
    • TODO: 1351. Count Negative Numbers in a Sorted Matrix
    • TODO: 1318. Minimum Flips to Make a OR b Equal to c
    • TODO: 1502. Can Make Arithmetic Progression From Sequence
    • TODO: 39. Combination Sum
    • TODO: 78. Subsets
    • TODO: 1232. Check If It Is a Straight Line
    • TODO: 47. Permutations II
    • 1. Two Sum
    • 2. Add Two Numbers
    • 3. Longest Substring Without Repeating Characters
    • 11. Container With Most Water
    • 15. 3Sum
    • 19. Remove Nth Node From End of List
    • 20. Valid Parentheses
    • 21. Merge Two Sorted Lists
    • 31. Next Permutation
    • 33. Search in Rotated Sorted Array
    • 34. Find First and Last Position of Element in Sorted Array
    • 35. Search Insert Position
    • 62.Unique Paths
    • 63. Unique Paths II
    • 64. Minimum Path Sum
    • 70. Climbing Stairs
    • 81. Search in Rotated Sorted Array II
    • 120. Triangle
    • TODO: 124. Binary Tree Maximum Path Sum
    • 138. Copy List with Random Pointer
    • 141. Linked List Cycle
    • 153. Find Minimum in Rotated Sorted Array
    • 189. Rotate Array
    • 198. House Robber
    • 213. House Robber II
    • 244. Shortest Word Distance II
    • 268. Missing Number
    • 278. First Bad Version
    • 416. Partition Equal Subset Sum
    • 496. Next Greater Element I
    • 547. Number of Provinces
    • 556. Next Greater Element III
    • 698. Partition to K Equal Sum Subsets
    • 741. Cherry Pickup
    • 744. Find Smallest Letter Greater Than Target
    • 876. Middle of the Linked List
    • 929. Unique Email Addresses
    • 931. Minimum Falling Path Sum
    • 994. Rotting Oranges
    • 1091. Shortest Path in Binary Matrix
    • 1150. Check If a Number Is Majority Element in a Sorted Array
    • 1376. Time Needed to Inform All Employees
    • 1463. Cherry Pickup II
    • 2096. Step-By-Step Directions From a Binary Tree Node to Another
    • 2101. Detonate the Maximum Bombs
  • Token Bucket - Rate Limiter Algo
Powered by GitBook
On this page

Was this helpful?

  1. Linked Lists

Bookmarks

LogoMust-Do LinkedList Problems on LeetcodeMedium
LogoReversal Pattern - Linked ListTechBum - System Design & Coding
PreviousTODO: Next Greater permutationNextTypes of Logics to solve Linked Lists

Last updated 2 years ago

Was this helpful?