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 3 Session 1

Part of TIP101 Unit 3

🔗 Problem Statements

Problem Set Version 1

  1. Calling Mississippi
  2. Swap Ends
  3. Is Pangram
  4. Reverse String
  5. First Unique
  6. Minimum Distance

Problem Set Version 2

  1. Perfect Match
  2. Remove Char
  3. Count Vowels
  4. Reverse Sentence
  5. String Compression
  6. Needle in a Haystack

Problem Set Version 3

  1. Choose Your Pokemon
  2. Rotate Left
  3. First Duplicate
  4. Find the Imposter
  5. Longest Substring
  6. Roman to Integer

Jump to Section

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