Leetcode

 Leetcode is one of the best platform to increase our programming skills with various types of problems. It also contains lots of problems types which is similar to problems asked in FAANG companies, Microsoft interview etc. It is more helpful for people whose dream is to join any FAANG companies or any of IT companies. Also, it is more useful to upskill your programming knowledge on all concepts such as Data Structures, Algorithms etc. Here you will find list of all Leetcode problems found in our blog.


NO        -      PROBLEM  WITH SOLUTION

15          -      3Sum

21          -       Merge Two Sorted Lists

66          -      Plus One

88          -      Merge Sorted Array

98          -      Validate Binary Search Tree

107        -       Binary Tree Level Order Traversal II

110        -       Balanced Binary Tree

264        -      Ugly Number II

290        -      Word Pattern

421        -      Maximum XOR of two numbers in an array

430        -       Flatten a Multilevel Doubly Linked List

441        -        Arranging Coins

456        -        132 Pattern 

461       -          Hamming Distance   

463        -         Island Perimeter

520        -         Detect Capital

567        -        Permutation in String

662        -       Maximum Width of Binary Tree

865       -         Smallest Subtree with all the Deepest Nodes

901        -      Online Stock Span

910       -         Smallest Range II

941        -       Valid Mountain Array

957        -       Prison cells after N days

977        -       Squares of a Sorted Array

1029      -       Two City Scheduling

1041      -     Robot bounded in a Circle

1291      -     Sequential Digits          

1492      -       The kth Factor of n 

1646      -     Get Maximum in Generated Array

1704       -    Determine if String halves are Alike                  

Related Posts:


Like us? Please do share with your friends ..!!

Follow us to receive updates instantly.

If you have any feedback/suggestions, leave it in a comment section or contact us through our contact page which will be helpful for us to improve.

Comments

Post a Comment

Popular posts from this blog

First Unique Character in a String

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Note: You may assume the string contain only lowercase letters. class Solution {     public int firstUniqChar(String s) {         int length = s.length();         String str;         for(int i=0;i<length;i++){             if(i==length-1){                 str = s.substring(0, i);             }             else{                 str = s.substring(0,i)+s.sub...
Read more

Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of  every  node differ in height by no more than 1. Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: Input: root = [1,2,2,3,3,null,null,4,4] Output: false Example 3: Input: root = [] Output: true   Constraints: The number of nodes in the tree is in the range  [0, 5000] . -10 4  <= Node.val <= 10 4 Solution: /**  * Definition for a binary tree node.  * public class TreeNode {  *     int val;  *     TreeNode left;  *     TreeNode right;  *     TreeNode() {}  *     TreeNode(int val) { this.val = val; }  *     TreeNode(int ...
Read more

Majority Element

Given an array of size n , find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2   class Solution { public int majorityElement(int[] nums) { Arrays.sort(nums); return nums[nums.length/2]; } } Here, we are sorting the entire array using sort() of Arrays class. Then, number at index position n/2 would be a majority element. There is no chance of wrong values in odd or even length.   Below is another method using HashMap. METHOD 2: class Solution { public int majorityElement(int[] nums) { HashMap<Integer, Integer>list = new HashMap<Integer, Integer>(); int ...
Read more

Sequential Digits

An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers in the range [low, high]  inclusive that have sequential digits. Example 1: Input: low = 100, high = 300 Output: [123,234] Example 2: Input: low = 1000, high = 13000 Output: [1234,2345,3456,4567,5678,6789,12345] Constraints: 10 <= low <= high <= 10^9 class Solution {     public List<Integer> sequentialDigits(int low, int high) {         List<Integer> result = new ArrayList();         String str = "123456789";         int i, j, length = str.length(), num;         for( i = 2; i <= length; i++) {             for( j = 0; j <= length - i; j++) {      ...
Read more