LeetCode : Symmetric Tree Problem

By

 


           Problem statement:-

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

           


 

            Solution:-



Comments

Post a Comment

Popular posts from this blog

3 Lines of Code And You Can Download Your Favourite Youtube Video.

By
Image
Lets Dive Into the code. Firstly you need to install pytube  using pip install pytube. You then need to import pytube library I have used sys library to take input from command line you dont need it Just replace your url with sys.argv[1] Please find the sample url https://www.youtube.com/watch?v=Jx5Vn4F0OBc&t=45s You then need to stream the first video from the object yt Finally use download method and dowload it to your desktop location Here I have given my desktop location,you can replace it with yours. Thats it walla!!! import pytube import sys # replace sys.argv[1] with your youtube link yt = pytube.YouTube(sys.argv[ 1 ]) stream = yt.streams.first() stream.download( "D:/" ) print ( "Video Downloaded" )
Read more

Leetcode Problem(Easy) Roman to Integer

By
  Roman numerals are represented by seven different symbols:  I ,   V ,   X ,   L ,   C ,   D   and   M . Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example,  2  is written as  II  in Roman numeral, just two ones added together.  12  is written as  XII , which is simply  X + II . The number  27  is written as  XXVII , which is  XX + V + II . Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not  IIII . Instead, the number four is written as  IV . Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as  IX . There are six instances where subtraction is used: I  can be placed before  V  (5) and  X  (10) to make 4 an...
Read more

Leetcode : (Find Minimum in Rotated Sorted Array)

By
Image
   package com.demo.leetcode ; public class FindMinInRotatedArray { public static void main ( String [] args ) { int [] numArr = new int []{ 3 , 4 , 5 , 1 , 2 }; System . out . println ( "Min is = " + findMin ( numArr )); } private static int findMin ( int [] nums ) { int low = 0 ; int high = nums .length - 1 ; while ( low < high ){ int mid = low + ( high - low ) / 2 ; // just to escape integer overflow if ( nums [ mid ] > nums [ high ]){ low = mid + 1 ; } else { high = mid ; } } return nums [ low ]; } }  
Read more