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 5 Session 2

Part of TIP103 Unit 5

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

  1. Greatest Node
  2. Remove Tail
  3. Delete Duplicates in a Linked List
  4. Does it Cycle
  5. Remove Nth Node From End of List
  6. Careful Reverse

Problem Set Version 2 (Solutions Only)

  1. Array to Linked List
  2. Get it Out of Here!
  3. Partition List Around Value
  4. Middle Match
  5. Put it in Reverse
  6. Symmetrical

Jump to Section

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