Fullstack Developer

I have to build a webpage from a Figma design and translate the visual design into a functioning web page.

Firstly I have to Study the Figma File to understand the layout, components, colors, typography, and other design elements.
Gather Assets: Export images, icons, and other assets provided in the Figma design.

At last from Figma design to the fully functional website within the given Tech Stack.

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:

1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".

You are given an integer array 'A' of size 'N', sorted in non-decreasing order. You are also given an integer 'target'. Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. If 'target' is not present in the array 'A', return -1.

Note:

You must write an algorithm whose time complexity is O(LogN)

What is the difference between var, let, const (Learn)

The HR representative expressed interest in learning more about me. She also provided insights into the company, my prospective role, and the responsibilities I would undertake. Additionally, they assessed my positivity and readiness to embrace challenges