πŸ“•
Krishna's Interview Prep
search
⌘Ctrlk
πŸ“•
Krishna's Interview Prep
  • Preparation Notes
  • πŸ§‘β€πŸ’»Technology
    • Backend Communication
    • Kafka
    • Databases
    • Operating Systems
  • Distributed Systems and System Design
    • Distributed locking
  • Interesting Work Problems
    • Articles Bookmark
  • Patterns
    • ruler-triangleRight triangle pattern
  • Group 1
    • Page 1
  • β˜•java
    • Java Virtual Machine Architecture
    • Garbage Collection in Java
    • JMX Beans
    • Collections to be learned
    • Internals of HashMap
    • Reflection
    • Static vs Non Static variables
    • JPA, ORM and Hibernate ORM
    • Parallel and Async Processing in JAVA
    • Semaphores in Java
    • Optionals
    • Streams
    • Records
    • Singleton with Reflection Proof
  • DSA interview format
  • Mega Bookmarks
  • Google Interview approach
  • CheatSheet
  • Initial notes on DSAarrow-up-right
  • Get Well Prepared for Google Interview
  • Maths
    • Combinatorics
    • Permutations vs Combinations
  • Concepts
    • clockTime Complexity(TC)
    • Permutation, Combination and Subset
    • Subarray, Subsequence and Subset
    • Floor and Ceiling of number
    • Modulo Congurence
    • Arrays and their sorted orders
  • Algorithms
    • Boyer-Moore Voting Algorithm
    • Kadanes Algorithm
    • Merge Sort
  • Quirks
    • Getting Character as a numeric value
    • Comparator in Java
    • Bookmarks
  • Arrays and Strings
    • Prefix Sum
    • Sliding Window
    • Monotonic Stack
    • Cyclic Sort
    • Two Pointers
    • Permutation
    • Next Variants
    • Study Required
  • Linked Lists
    • Bookmarks
    • Types of Logics to solve Linked Lists
    • Singly Linked List
    • Circular LinkedList
    • Doubly Linked List
  • Binary Search
    • Core Concept
    • Bookmarks
    • Template
    • Problems
  • πŸ”™Backtracking
    • Bookmarks
  • Greedy
    • Bookmarks
    • Problems
  • Trees
    • Bookmarks
    • Important Concepts
    • Depth First Search (DFS)
    • Breadth First Search (BFS)
    • Binary Trees
    • Binary Search Trees
    • Tries
    • Segment Trees
  • Graphs
    • Core Concept
    • Bookmarks
    • Representation of graphs
    • Breadth First Search
    • Depth First Search
    • Disjoint Sets - Union Find (Connected Components)
    • Cycle in Graph
    • Topological Sort
    • Bipartite Graph
    • Grid Coloring / Flood Fill
    • Shortest Path
  • Intervals
  • Heap/Priority Queue
    • Core Concept
    • Implementation
    • Bookmarks
    • Time and Space complexities for common operations in Heap
    • Scheduling
    • Top "K" Elements
    • Meeting Rooms
    • Merge Interval
  • Dynamic Programming
    • Bookmarks
    • 2D - DP
    • 1D - Dynamic Programming
    • 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
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Greedy

Bookmarks

LogoMinimum Number of Arrows to Burst Balloons - LeetCodeLeetCodechevron-right
LogoMinimum Number of Arrows to Burst Balloons - LeetCodeLeetCodechevron-right
PreviousBookmarkschevron-leftNextProblemschevron-right

Last updated 2 years ago