πŸ‘¨β€πŸ’»
Cracking-Interview
search
⌘Ctrlk
πŸ‘¨β€πŸ’»
Cracking-Interview
  • Data Structures and Algorithms
  • Arrays
  • Linked List
  • Strings
  • Binary Tree
  • Stack and Queue
  • Hash Table
  • Binary Search
  • Binary Search Tree
  • Bit manipulation
  • Graph
  • Disjoint Sets(Union-Find)
  • Heap and Priority Queue
  • Trie
  • Dynamic Programming
  • Greedy Algorithms
    • 1.Activity Selection
    • 2. N meetings in one room
    • 3.Minimum Platforms
    • 4. Car Pooling
    • 5. Maximum Population Year
    • 6.Meeting Rooms
    • 7. Equal Sum Arrays With Minimum Number of Operations
    • 8. Two City Scheduling
    • 9. Non-overlapping Intervals
    • 10. Minimum Number of Arrows to Burst Balloons
    • 11. Maximum Profit in Job Scheduling{IMP}
    • 12.Huffman Coding
    • 13. Minimum Cost Tree From Leaf Values
    • 14.Maximum Number of Events That Can Be Attended
    • 15. Video Stitching
    • 16. Minimum Number of Taps to Open to Water a Garden
  • Backtracking
  • Sub Array and Sliding Window Problems
  • Design
  • Maths
  • Sorting-Algorithms
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
  • Expected Interview MCQ and Questions c++
  • Concepts in C++
  • System Design Questions
  • πŸ’ΎDBMS
    • Introduction
    • RBMS
    • JOINS
    • SQL
  • πŸ–₯️OS
    • OS and Its Types
    • Process Concept and Threads
    • Process Synchronization
    • Deadlock in Operating System
    • Memory Management
    • Imp Questions of OS for Interviews
  • πŸš™OOPS
    • Introduction and Definitions
  • πŸ“¨COMPUTER-NETWORKS
    • OSI | TCP IP Model
    • Topology
    • Network Devices
    • IP Address
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Greedy Algorithms

1.Activity Selectionchevron-right2. N meetings in one roomchevron-right3.Minimum Platformschevron-right4. Car Poolingchevron-right5. Maximum Population Yearchevron-right6.Meeting Roomschevron-right7. Equal Sum Arrays With Minimum Number of Operationschevron-right8. Two City Schedulingchevron-right9. Non-overlapping Intervalschevron-right10. Minimum Number of Arrows to Burst Balloonschevron-right11. Maximum Profit in Job Scheduling{IMP}chevron-right12.Huffman Codingchevron-right13. Minimum Cost Tree From Leaf Valueschevron-right14.Maximum Number of Events That Can Be Attendedchevron-right15. Video Stitchingchevron-right16. Minimum Number of Taps to Open to Water a Gardenchevron-right

Previous56. Ones and Zeroeschevron-leftNext1.Activity Selectionchevron-right

Last updated 4 years ago