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

TIP101 Unit 6 Session 1

Part of TIP101 Unit 6

🔗 Problem Statements

Problem Set Version 1

  1. Nested Constructors
  2. Find Frequency
  3. Remove Tail
  4. Find the Middle
  5. Is Palindrome
  6. Put it in Reverse

Problem Set Version 2

  1. One to Many
  2. Find Max
  3. Remove First Value
  4. Middle Match
  5. Where Do We Begin
  6. Was That a Crit

Problem Set Version 3

  1. The Power of One
  2. Frequency Map
  3. Get it Out of Here!
  4. Does it Cycle
  5. Are We There Yet
  6. Reverse Them, K

Jump to Section

  • 🔗 Problem Statements
  • Problem Set Version 1
  • Problem Set Version 2
  • Problem Set Version 3