Skip to content

added First Missing Positive question from the Hard Category of Leetcode problems #253

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

added First Missing Positive question from the Hard Category of Leetcode problems #253

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
4dca796
41. First Missing Positive question of Leetcode
vatsal-dp Oct 18, 2021
8924a20
removed package line
vatsal-dp Oct 18, 2021
754603e
.
vatsal-dp Oct 18, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
removed package line
  • Loading branch information
@vatsal-dp
vatsal-dp authored Oct 18, 2021
commit 8924a209e24d13a717894a2e33b1b5c10550d7a7
2 changes: 0 additions & 2 deletions Java/FirstMissingPositive.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,6 @@
You must implement an algorithm that runs in O(n) time and uses constant extra space.
*/

package com.vatsal;

class Solution {
public int firstMissingPositive(int[] nums) {
int i = 0;
Expand Down