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

TIP103 Unit 1 Session 1

Part of TIP103 Unit 1

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

  1. Hunny Hunt
  2. Bouncy Flouncy Trouncy Pouncy
  3. T-I-Double Guh-Er II
  4. Non-Decreasing Array
  5. Missing Clues
  6. Vegetable Harvest
  7. Eeyore’s House
  8. Local Maximums

Problem Set Version 2 (Solutions Only)

  1. Words Containing Character
  2. HulkSmash
  3. Encode
  4. Good Samaritan
  5. Heist
  6. Smaller Than
  7. Diagonal
  8. Defuse the Bomb

Jump to Section

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