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 about 2 months ago | View on GitHub

TIP102 Unit 9 Session 2

Part of TIP102 Unit 9

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

  1. Balanced Baked Goods Display
  2. Sum of Cookies Sold Each Day
  3. Sweetness Difference
  4. Transformable Bakery Orders
  5. Larger Order Tree
  6. Find Next Order to Fulfill Today

Problem Set Version 2 (Solutions Only)

  1. Haunted Mirror
  2. Pumpkin Patch Path
  3. Largest Pumpkin in Each Row
  4. Counting Room Clusters
  5. Purging Unwanted Guests
  6. Sectioning Off Cursed Zones

Jump to Section

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