Skip to main content

Full Stack Developer Without Degree: How to Become One

If you're interested in becoming a Full Stack Developer without a degree, we've put together some tips and resources to help you get started. Learn the Fundamentals The first step to becoming a Full Stack Developer is to learn the fundamentals of coding. You can start with HTML, CSS, and JavaScript, which are the building blocks of web development. There are plenty of free resources available online, such as Codecademy and FreeCodeCamp, which offer interactive courses that teach you the basics of web development. Once you have a solid understanding of the basics, you can move on to more advanced topics such as back-end development, databases, and frameworks. You can learn these topics through online courses or by working on personal projects. Build a Portfolio One of the most important things you can do as a Full Stack Developer is to build a portfolio. Your portfolio should showcase your skills and experience and demonstrate your ability to build real-world applications. You c...

Leaders in an array (DSA)



Problem Statement:(👈click here for GFG)

Given an array A of positive integers. Your task is to find the leaders in the array. An element of array is leader if it is greater than or equal to all the elements to its right side. The rightmost element is always a leader. 

Example 1:

Input:
n = 6
A[] = {16,17,4,3,5,2}
Output: 17 5 2
Explanation: The first leader is 17 
as it is greater than all the elements
to its right.  Similarly, the next 
leader is 5. The right most element 
is always a leader so it is also 
included.

 Example 2:

Input:
n = 5
A[] = {1,2,3,4,0}
Output: 4 0

Your Task:

You don't need to read input or print anything. The task is to complete the function leader() which takes array A and n as input parameters and returns an array of leaders in order of their appearance.

Expected Time Complexity: O(n)

Expected Auxiliary Space: O(n)

Constraints:

1 <= n <= 107

0 <= Ai <= 107


Solution:

The approach of this code is to find the leaders in the given array. Leaders are the elements in the array that are greater than all the elements to their right.

The code starts by initializing an array 'leaders' with the last element of the input array 'arr'. It then initializes a variable 'max' with the same value. It then iterates over the elements of the input array from the second last element to the first element. For each element, it checks if it is greater than or equal to 'max'. If it is, it is considered a leader, and it is added to the 'leaders' array, and 'max' is updated to its value. Finally, the 'leaders' array is reversed and returned as the output.

class Solution {

    // Function to find the leaders in the array.

    leaders(arr) {

        const leaders = [arr[arr.length - 1]];

        let max = arr[arr.length - 1];


        for (let i = arr.length - 2; i >= 0; i--) {

            if (arr[i] >= max) {

                leaders.push(arr[i]);

                max = arr[i];

            }

        }

        return leaders.reverse(); // if you need to console.log the output then simply type console.log(${leaders.reverse()});

    }

}


// Prompt the user to enter the array elements.

const arr = prompt("Enter the array elements (comma-separated):").split(",").map((element) => parseInt(element.trim()));

// Create a new instance of the Solution class and call the leaders function.

const solution = new Solution();

const leaders = solution.leaders(arr);

// Output the leaders.

console.log(`The leaders in the array are: ${leaders}`);


Thank you,

Learning is a never-ending process, and every day is an opportunity to learn something new. Keep exploring, keep pushing your limits, and keep striving towards your goals. Remember that every small step counts, and even the smallest progress is worth celebrating. Don't be afraid to ask questions, seek guidance, and learn from others. With dedication and hard work, you can achieve anything you set your mind to. So keep learning, keep growing, and keep shining!

Comments

Popular posts from this blog

Boundary Traversal of binary tree (DSA)

  Problem Statement :(👈click here for GFG) Given a Binary Tree, find its Boundary Traversal. The traversal should be in the following order:  Left boundary nodes:  defined as the path from the root to the left-most node  ie- the leaf node you could reach when you always travel preferring the left subtree over the right subtree.  Leaf nodes:  All the leaf nodes except for the ones that are part of left or right boundary. Reverse right boundary nodes:  defined as the path from the right-most node to the root. The right-most node is the leaf node you could reach when you always travel preferring the right subtree over the left subtree. Exclude the root from this as it was already included in the traversal of left boundary nodes. Note:  If the root doesn't have a left subtree or right subtree, then the root itself is the left or right boundary.  Example 1: Input: 1   /...

Finding middle element in a linked list (DSA)

  Problem Statement:  (👈click here for GFG) Given a singly linked list of  N  nodes. The task is to find the  middle  of the linked list. For example, if the linked list is 1-> 2->3->4->5 ,   then the middle node of the list is  3 . If there are two middle nodes(in case, when  N  is even), print the  second middle  element. For example, if the linked list given is  1->2->3->4->5->6 , then the middle node of the list is  4 . Example 1: Input: LinkedList: 1->2->3->4->5 Output: 3 Explanation: Middle of linked list is 3. Example 2:  Input: LinkedList: 2->4->6->7->5->1 Output: 7 Explanation: Middle of linked list is 7. Your Task: The task is to complete the function getMiddle() which takes a head reference as the only argument and should return the data at the middle node of the linked list. Expected Time Complexity: O(N). Expected Auxilia...

Nth node from end of linked list (DSA)

  Problem Statement :(👈click here for GFG) Given a linked list consisting of  L  nodes and given a number  N . The task is to find the  N th  node from the end of the linked list. Example 1: Input: N = 2 LinkedList: 1->2->3->4->5->6->7->8->9 Output: 8 Explanation: In the first example, there are 9 nodes in linked list and we need to find 2nd node from end. 2nd node from end is 8.   Example 2: Input: N = 5 LinkedList: 10->5->100->5 Output: -1 Explanation: In the second example, there are 4 nodes in the linked list and we need to find 5th from the end. Since 'n' is more than the number of nodes in the linked list, the output is -1. Your Task: The task is to complete the function getNthFromLast() which takes two arguments: reference to head and N and you need to return Nth from the end or -1 in case node doesn't exist. Note: Try to solve in a single traversal. Expected Time Complexity: O(N). Expected A...