LeetCode Exercise 2

Moodle Link

Due: February 8, 9:00am

The goal of this assignment is to develop skill in solving problems in the LeetCode environment.

Two person teams will are assigned for this assignment. You should work together collaboratively, but should each turn in a solution to Moodle.

Team 1 Charlie, Isaac
Team 2 Flynn, Boning
Team 3 Kyle, Thomas
Team 3 Preston , Jack


Problem 1 (moderate)

Solve 392. Is Subsequence using a greedy algorithm

  • 50% for solution that functions correctly
  • 50% for a correct proof using a loop invariant.
Problem 2 (harder)

Solve 402. Remove K Digits using a greedy algorithm

  • 60% for solution that functions correctly
  • 60% for a correct proof using either induction or loop invariants.
Turn in:
  1. Source code for your solution
  2. Complete proof
  3. Samples runs showing the operation with input and outputs.
Be prepared to discuss you solutions in class.

-- TWiki Admin User - 2016-08-14


Edit | Attach | Watch | Print version | History: r9 < r8 < r7 < r6 < r5 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r9 - 2019-02-04 - JimSkon
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback