Skip to main content

Posts

Showing posts with the label strings

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

Anagram (DSA)

By
  Problem Statement :(👈click here for GFG) Given two strings  a  and  b  consisting of lowercase characters. The task is to check whether two given strings are an anagram of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, act and tac are an anagram of each other. Note:- If the strings are anagrams you have to  return True or else return False |s|  represents the length of string s. Example 1: Input: a = geeksforgeeks, b = forgeeksgeeks Output: YES Explanation: Both the string have same characters with same frequency. So, both are anagrams. Example 2: Input: a = allergy, b = allergic Output: NO Explanation: Characters in both the strings are   not same, so they are not anagrams. Your Task: You don't need to read input or print anything. Your task is to complete the function isAnagram() which takes the string a and string b as i...
Post a Comment
Read more

Parenthesis Checker (DSA)

By
Problem Statement :(👈click here for GFG) Given an expression string   x . Examine whether the pairs and the orders of {,},(,),[,] are correct in exp. For example, the function should return 'true' for exp = [()]{}{[()()]()} and 'false' for exp = [(]). Note:  The drive code prints "balanced" if function return true, otherwise it prints "not balanced". Example 1: Input : {([])} Output : true Explanation : { ( [ ] ) }.  Same colored brackets can form balanced pairs, with 0 number of unbalanced bracket. Example 2: Input : () Output : true Explanation : () . Same bracket can form balanced pairs, and here only 1 type of bracket is present and in balanced way. Example 3: Input : ([] Output : false Explanation : ( [] . Here square bracket is balanced but the small bracket is not balanced and Hence , the output will be unbalanced. Your Task: This is a  function  problem. You only need to complete the function  ispar()  that takes a  ...
Post a Comment
Read more