Focus these all java will be done 🔥🔥🔥

Discussion group has been added for questions n answers

This one

Question of the day 😊


20. Valid Parentheses
Level Easy


Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Every close bracket has a corresponding open bracket of the same type.


Example 1:

Input: s = "()"
Output: true
Example 2:

Input: s = "()[]{}"
Output: true
Example 3:

Input: s = "(]"
Output: false


Constraints:

1 <= s.length <= 104
s consists of parentheses only '()[]{}'.

For fast execution you can use stack best time 1ms

Shortest code length 3 statement

Hope this is done 😊 can send us your explanation @stockkida

The day after tomorrow I will cover the complete array from basic to advanced and complete your registration tomorrow will share the link

{
"product" : "two" ,
"init" : "2022111412" ,
"dataseries" : [
{
"timepoint" : 204,
"cloudcover" : 6,
"lifted_index" : 10,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 1,
"wind10m" : {
"direction" : "SE",
"speed" : 2
},
"weather" : "mcloudy"
},
{
"timepoint" : 216,
"cloudcover" : 6,
"lifted_index" : 10,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 7,
"wind10m" : {
"direction" : "SE",
"speed" : 2
},
"weather" : "mcloudy"
},
{
"timepoint" : 228,
"cloudcover" : 5,
"lifted_index" : 10,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 2,
"wind10m" : {
"direction" : "N",
"speed" : 2
},
"weather" : "mcloudy"
},
{
"timepoint" : 240,
"cloudcover" : 4,
"lifted_index" : 10,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 14,
"wind10m" : {
"direction" : "NW",
"speed" : 2
},
"weather" : "mcloudy"
},
{
"timepoint" : 252,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 3,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 264,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 14,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 276,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 3,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 288,
"cloudcover" : -9999,
"lifted_index" : 6,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 13,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 300,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 5,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 312,
"cloudcover" : -9999,
"lifted_index" : 6,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 10,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 324,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 4,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 336,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 12,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 348,
"cloudcover" : -9999,
"lifted_index" : 2,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 15,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 360,
"cloudcover" : -9999,
"lifted_index" : 15,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 10,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 372,
"cloudcover" : -9999,
"lifted_index" : 10,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 2,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
},
{
"timepoint" : 384,
"cloudcover" : -9999,
"lifted_index" : 15,
"temp2m" : {
"max" : ,
"min" :
},
"rh2m" : 9,
"wind10m" : {
"direction" : "-9999",
"speed" : -9999
},
"weather" : "clear"
}
]
}

Code getting one error 🤣

DSA FULL NOTES HAND WRITTEN

Trellix is hiring Software Development Engineer intern
Role - SDE intern
Passout year: 2022/2023/2024
Qualification - B.E /B.Tech /M.E /M.Tech /MCA /BCA
Salary - 35kPM



Apply now https://careers.trellix.com/job/software-engineer-intern-9/

Last day code but it's not working 😂😔

2. Add Two Numbers
Level :-
Medium


You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.



Example 1:


Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]


Constraints:

The number of nodes in each linked list is in the range [1, 100].
0 <= Node.val <= 9
It is guaranteed that the list represents a number that does not have leading zeros.

Solve it