-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day21-LeetcodeEasy.js
67 lines (57 loc) · 2.19 KB
/
Day21-LeetcodeEasy.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
// Day 21: LeetCode Easy
// Tasks/Activities:
// Activity 1: Two Sum
// . Task 1: Solve the "Two Sum" problem on LeetCode.
// o Write a function that takes an array of numbers and a target number, and returns the indices of the two numbers that add up to the target.
// o Log the indices for a few test cases.
/**
* @param {number[]} nums
* @param {number} target
* @return {number[]}
*/
var twoSum = function(nums, target) {
for(let i=0;i<nums.length;i++){
for(let j=i+1;j<nums.length;j++){
if(nums[i]+nums[j] === target){
return [i,j];
}
}
}
return [];
};
// Activity 2: Reverse Integer
// . Task 2: Solve the "Reverse Integer" problem on LeetCode.
// . Write a function that takes an integer and returns it with its digits reversed.
// . Handle edge cases like negative numbers and numbers ending in zero.
// . Log the reversed integers for a few test cases.
/**
* @param {number} x
* @return {number}
*/
var reverse = function(x) {
let y = 0;
const INT_MAX = 2 ** 31 - 1;
const INT_MIN = -(2 ** 31);
while (x !== 0) {
let digit = x % 10;
if (y > INT_MAX / 10 || y < INT_MIN / 10) {
return 0;
}
y = y * 10 + digit;
x = Math.trunc(x / 10);
}
return y;
};
// Activity 3: Palindrome Number
// . Task 3: Solve the "Palindrome Number" problem on LeetCode.
// o Write a function that takes an integer and returns true if it is a palindrome, and false otherwise.
// . Log the result for a few test cases, including edge cases like negative numbers.
// Activity 4: Merge Two Sorted Lists
// . Task 4: Solve the "Merge Two Sorted Lists" problem on LeetCode.
// . Write a function that takes two sorted linked lists and returns a new sorted list by merging them.
// . Create a few test cases with linked lists and log the merged list.
// Activity 5: Valid Parentheses
// . Task 5: Solve the "Valid Parentheses" problem on LeetCode.
// o Write a function that takes a string containing just the characters '(, ")', {, }, T and ']', and determines if the input string is valid.
// . A string is valid if open brackets are closed in the correct order.
// o Log the result for a few test cases.