search any element in Dictionary

     
j=int(input("Any element to find in dictionary "))      
d={1:2,3:4,5:{11:12},7:8}
l=list(d.values())
k=[]
for i in l:
        if isinstance(i,int):
                k.append(i)
        if isinstance(i,dict):
                l=k.append(list(i.values())[0])    
if j in k:
        print("It is present")  
else:
        print("It is not present")
               

Comments

Post a Comment

Popular posts from this blog

Basic Calc using Python Tkinter

  from  tkinter  import * root=Tk() root.geometry( "300x520" ) root.title( "Calculator by Elalita" ) scvalue=StringVar() scvalue.set( " " ) screen=Entry(root,  textvar =scvalue, font = "lucida 40 bold" ) screen.pack( fill  =X, ipadx = 8 ,  padx = 10 ,  pady = 10 ) def   click ( event ):      global  scvalue     text=event.widget.cget( "text" )      print (text)      if  text== "=" :          if   scvalue.get().isdigit():             vlaue= int (scvalue.get())          else :              try :                 value= eval (screen.get())   ...
Read more

Gues random number

  import random i = 0 randon_range = int ( input ( "Enter range=" )) while True :     n = int ( input ( "Your Gues the number =" ))     x = random . randint ( 0 , randon_range )     print ( "Computer gues=" , x )       if x == n :         print ( "****You won****" )         i = i + 1         break     else :         i = i + 1         print ( "!!!!!!You loos!!!!!!!" )     print ( "Number of gues=" , i )
Read more

Star pattern in Java

  public class pattern_practice {     public static void main ( String [] args ) {         // for(int i=0;i<5;i++){         //     for(int j=0;j<=i;j++){         //       System.out.print("*");         //     }         //     System.out.print("\n");         // }         //////////////////////////////         // int m = 0;         // for(int i=0;i<5;i++){         //     for(int j=1;j<=i;j++){         //       System.out.print(m);         //       m=m+1;         //     }         //     System.out.print("\n");         // }           ...
Read more