Skip to main content

Posts

Full Stack Developer Without Degree: How to Become One

By
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...
Post a Comment
Read more

Detect cycle in an undirected graph (DSA)

By
  Problem Statement :(👈click here for GFG) Given an undirected graph with V vertices and E edges, check whether it contains any cycle or not. Graph is in the form of adjacency list where adj[i] contains all the nodes ith node is having edge with. Example 1: Input:    V = 5, E = 5 adj = {{1}, {0, 2, 4}, {1, 3}, {2, 4}, {1, 3}}   Output: 1 Explanation: 1->2->3->4->1 is a cycle. Example 2: Input: V = 4, E = 2 adj = {{}, {2}, {1, 3}, {2}} Output: 0 Explanation: No cycle in the graph. Your Task: You don't need to read or print anything. Your task is to complete the function isCycle() which takes V denoting the number of vertices and adjacency list as input parameters and returns a boolean value denoting if the undirected graph contains any cycle or not, return 1 if a cycle is present else return 0. NOTE: The adjacency list denotes the edges of the graph where edges[i] stores all other vertices to which ith vertex is connected. Expected Time Comple...
Post a Comment
Read more

Nth node from end of linked list (DSA)

By
  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...
Post a Comment
Read more

Count pairs with given sum (DSA)

By
  Problem Statement: (👈click here for GFG) Given an array of  N  integers, and an integer  K , find the number of pairs of elements in the array whose sum is equal to  K . Example 1: Input: N = 4, K = 6 arr[] = {1, 5, 7, 1} Output: 2 Explanation: arr[0] + arr[1] = 1 + 5 = 6 and arr[1] + arr[3] = 5 + 1 = 6. Example 2: Input: N = 4, K = 2 arr[] = {1, 1, 1, 1} Output: 6 Explanation:   Each 1 will produce sum 2 with any 1. Your Task: You don't need to read input or print anything. Your task is to complete the function getPairsCount() which takes arr[], n and k as input parameters and returns the number of pairs that have sum K. Expected Time Complexity: O(N) Expected Auxiliary Space: O(N) Constraints: 1 <= N <= 105 1 <= K <= 108 1 <= Arr[i] <= 106 Solution: class Solution { getPairsCount(arr,n,k){ //code here let count = 0; let hash = {}; for(let i = 0; i < n; i++){ ...
Post a Comment
Read more

Next Greater Element (DSA)

By
  Problem Statement :(👈click here for GFG) Given an array  arr[ ]  of size  N  having elements, the task is to find the next greater element for each element of the array in order of their appearance in the array. Next greater element of an element in the array is the nearest element on the right which is greater than the current element. If there does not exist next greater of current element, then next greater element for current element is -1. For example, next greater of the last element is always -1. Example 1: Input : N = 4, arr[] = [1 3 2 4] Output : 3 4 4 -1 Explanation : In the array, the next larger element to 1 is 3 , 3 is 4 , 2 is 4 and for 4 ? since it doesn't exist, it is -1. Example 2: Input : N = 5, arr[] [6 8 0 1 3] Output : 8 -1 1 3 -1 Explanation : In the array, the next larger element to 6 is 8, for 8 there is no larger elements hence it is -1, for 0 it is 1 , for 1 it is 3 and then for 3 there is no larger element on right...
Post a Comment
Read more

0 - 1 Knapsack Problem (DSA)

By
  Problem Statement :(👈click here for GFG) You are given weights and values of  N  items, put these items in a knapsack of capacity  W  to get the maximum total value in the knapsack. Note that we have only  one quantity of each item . In other words, given two integer arrays  val[0..N-1]  and  wt[0..N-1]  which represent values and weights associated with  N  items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of  val[]  such that sum of the weights of this subset is smaller than or equal to  W.  You cannot break an item,  either pick the complete item or dont pick it (0-1 property) . Example 1: Input: N = 3 W = 4 values[] = {1,2,3} weight[] = {4,5,1} Output: 3 Example 2: Input: N = 3 W = 3 values[] = {1,2,3} weight[] = {4,5,6} Output: 0 Your Task: Complete the function knapSack() which takes maximum capacity W, weight array wt[], value ar...
Post a Comment
Read more

Trapping Rain Water (DSA)

By
  Problem Statement: (👈click here for GFG) Given an array  arr[]  of  N  non-negative integers representing the height of blocks. If width of each block is 1, compute how much water can be trapped between the blocks during the rainy season.    Example 1: Input: N = 6 arr[] = {3,0,0,2,0,4} Output: 10 Explanation: Example 2: Input: N = 4 arr[] = {7,4,0,9} Output: 10 Explanation: Water trapped by above block of height 4 is 3 units and above block of height 0 is 7 units. So, the total unit of water trapped is 10 units. Example 3: Input: N = 3 arr[] = {6,9,9} Output: 0 Explanation: No water will be trapped. Your Task: You don't need to read input or print anything. The task is to complete the function trappingWater() which takes arr[] and N as input parameters and returns the total amount of water that can be trapped. Expected Time Complexity: O(N) Expected Auxiliary Space: O(N) Constraints: 3 < N < 106 0 < Ai < 108 Solut...
Post a Comment
Read more

Left View of Binary Tree (DSA)

By
  Problem statement :(👈click here for GFG) Given a Binary Tree, return Left view of it. Left view of a Binary Tree is set of nodes visible when tree is visited from Left side. The task is to complete the function  leftView() , which accepts root of the tree as argument. Left view of following tree is 1 2 4 8.           1        /     \      2        3    /     \    /    \   4     5   6    7    \      8    Example 1: Input:   1  /  \ 3    2 Output: 1 3 Example 2: Input: Output: 10 20 40 Solution: class Solution { leftView(root) { let result = []; let maxLevel = {val: 0}; this.leftViewUtil(root, 1, maxLevel, result); return result...
Post a Comment
Read more