Computer Science fundamentals

Something beyond the job
Something beyond the qualification
Something you should notice

years of hardwork can be rewarded with you being fired in this dynamic age, & people are still looking for certainty in jobs & in their shell

Strange formula to remain Broke:

1. Start with schools - 15 L
2. Graduation - 5L
3. Post Graduation - 10 L

Salary starts at 3-5L p.a.

Now you work for next 10 years to not even break even

And then
House - 60L
Car - 10L
Luxuries -10L

Other expenses, are considered normal

Now you start paying another cycle for you & next generation for next 20 years

Next generation - Spend 50L to be capable of getting a job to start from ZERO

And we all work hard for it, isn't it?

The biggest cost people pay is not this debt, but to remain ignorant about it for entire life

Icing on the cake is we give same knowledge to our next generation to keep them broke

Your next generation pay for your fear of failure, self doubt & ignorance

Doing business is hard?

Really??

- Not in digital world
- Not as hard as getting broke hard way
- Not as hard as getting into financial uncertainties
- Not by taking all risks & be at mercy
- Not as hard as remaining in SISI zone

I would rather teach my next generation

- how to leverage knowledge digitally
- how to create business & wealth

How you choose to work hard?

By being broke or wealthy?

See 👇👇



#lifestyle #businesslifestyle #businessowner #motivation #skills
#inspiracion #businessleadership #leadership #leader #inspirational #motivationalquotes

Clicked n run less than a time click less than a fraction of second

Same question with 2 solutions with 0ms & 1 ms

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.complete it today by Eod

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 '()[]{}'.

3 possible solutions as per me

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.



Example 1:


Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]
Example 2:

Input: list1 = [], list2 = []
Output: []
Example 3:

Input: list1 = [], list2 = [0]
Output: [0]


Constraints:

The number of nodes in both lists is in the range [0, 50].
-100 <= Node.val <= 100
Both list1 and list2 are sorted in non-decreasing order.

/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode head = new ListNode(0);

if(list1 == null && list2 == null) return null; //null checking
if(list1 == null) return list2;
if(list2 == null) return list1;

if(list1.val > list2.val) { //comparing and merging
head = list2;
list2 = list2.next;
}
else {
head = list1;
list1 = list1.next;
}

head.next = mergeTwoLists(list1, list2);
return head;
}
}

Good question n lot much tricky

Marked as easy 😂 but it's headache question

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.



Example 1:


Input: n = 4
Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]
Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above
Example 2:

Input: n = 1
Output: [["Q"]]


Constraints:

1 <= n <= 9

class Solution {
public List<List<String>> solveNQueens(int n) {

}
}

int a= 10;
int b = 20;
gpay G = (r,s)->{r*s};
G.amount(a,b);