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

Part of TIP102 Unit 12

🔗 Problem Statements

Problem Set Version 1 (Solutions Only)

  1. Valid Anagram
  2. Count Binary Substring
  3. Diameter of a Binary Tree
  4. Meeting Rooms
  5. Best Time to Buy and Sell Stock
  6. Find All Paths From Source to Target

Problem Set Version 2 (Solutions Only)

  1. Sort Array by Increasing Frequency
  2. Invert Binary Tree
  3. Valid Parentheses
  4. Is Subsequence
  5. Number of Provinces
  6. Split Linked List in Parts

Jump to Section

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