Computer Science
Chapters
  • Technical Interviewing
  • Data Structures
  • Algorithms
Technical Interviewing
  • Big O Complexity Analysis
  • UMPIRE Interview Strategy
  • UMPIRE Cheat Sheets
  • UMPIRE Problem Solutions
  • TIP101 Breakout Problem Solutions
  • TIP102 Breakout Problem Solutions
  • TIP103 Breakout Problem Solutions
  • DSA for TIP Breakout Problem Solutions
Data Structures
  • Linked Lists
  • Temp Head
  • Multiple Pass
  • Linked List Two Pointer
  • Hash Tables
  • Stacks and Queues
  • Heaps
  • Strings and Arrays
  • Binary search
  • Two pointer (also known as ‘Sliding Window’)
  • Binary Trees
  • Binary Trees Iterative Traversal
  • Binary Trees 2nd Largest Node
  • Delete Node From Binary Search Tree
  • Graphs
  • Graph Traversals
  • Topological Sort
Algorithms
  • Backtracking
  • Dynamic Programming
  • Greedy Algorithms
  • Scheduling Meeting Rooms
  • Sorting Algorithms
  • Sorting colors
Updated 2 months ago | View on GitHub

TIP102 Unit 7 Session 2

Part of TIP102 Unit 7

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

  1. Finding the Perfect Cruise
  2. Booking the Perfect Cruise Cabin
  3. Count Checked In Passengers
  4. Determining Profitability of Excursions
  5. Finding the Shallowest Point
  6. Cruise Ship Treasure Hunt

Problem Set Version 2 (Solutions Only)

  1. Finding the Perfect Song
  2. Finding Tour Dates
  3. Sqrt(x)
  4. Granting Backstage Access
  5. Harmonizing Two Musical Tracks
  6. Merge Sort Playlist

Jump to Section

  • 🔗 Problem Statements
  • Problem Set Version 1 (Solutions Only)
  • Problem Set Version 2 (Solutions Only)