Coding Seekho
الذهاب إلى القناة على Telegram
Live Programming Videos : C, C++, Data Structure, Advanced Data Structure, Core Java, Advanced Java, Python
إظهار المزيدلم يتم تحديد البلدالتكنولوجيات والتطبيقات24 416
3 729
المشتركون
لا توجد بيانات24 ساعات
لا توجد بيانات7 أيام
لا توجد بيانات30 أيام
جاري تحميل البيانات...
القنوات المماثلة
سحابة العلامات
لا توجد بيانات
هل تواجه مشاكل؟ يرجى تحديث الصفحة أو الاتصال بمدير الدعم الخاص بنا.
الإشارات الواردة والصادرة
---
---
---
---
---
---
جذب المشتركين
مايو '24
مايو '24
+56
في 0 قنوات
أبريل '24
+84
في 0 قنوات
Get PRO
مارس '24
+68
في 0 قنوات
Get PRO
فبراير '24
+128
في 0 قنوات
Get PRO
يناير '24
+3 775
في 0 قنوات
| التاريخ | نمو المشتركين | الإشارات | القنوات | |
| 17 مايو | +5 | |||
| 16 مايو | 0 | |||
| 15 مايو | 0 | |||
| 14 مايو | +5 | |||
| 13 مايو | +2 | |||
| 12 مايو | +4 | |||
| 11 مايو | +1 | |||
| 10 مايو | +2 | |||
| 09 مايو | +3 | |||
| 08 مايو | +4 | |||
| 07 مايو | +3 | |||
| 06 مايو | +2 | |||
| 05 مايو | +12 | |||
| 04 مايو | +1 | |||
| 03 مايو | +4 | |||
| 02 مايو | +5 | |||
| 01 مايو | +3 |
منشورات القناة
| 2 | struct node
{
int data;
struct node*next;
};
struct node *start=0;
struct node *cn()
{
struct node *k1;
k1=(struct node *)malloc(sizeof(struct node));
printf("Enter a data:");
scanf("%d",&k1->data);
k1->next=k1;
return k1;
}
void is()
{
struct node *h1,*t1;
h1=cn();
if(start==0)
{
start=h1;
}
else
{
t1=start;
while(t1->next!=start)
{
t1=t1->next;
}
h1->next=start;
start=h1;
t1->next=h1;
}
}
void ie()
{
struct node *b1,*k1;
b1=cn();
if(start==0)
{
start=b1;
}
else
{
k1=start;
while(k1->next!=start)
k1=k1->next;
k1->next=b1;
b1->next=start;
}
}
im()
{
}
void ds()
{
struct node *g1;
if(start==0)
{
printf("There is no any node to delete");
}
else
{
g1=start;
while(g1->next!=start)
{
g1=g1->next;
}
g1->next=start->next;
g1=start;
start=start->next;
g1->next=0;
free(g1);
}
}
void de()
{
struct node *a1,*p1;
if(start==0)
{
printf("There is no any node to delete");
}
else
{
a1=start;
while(a1->next->next!=start)
{
a1=a1->next;
}
p1=a1->next;
a1->next=start;
p1->next=0;
free(p1);
}
}
dm()
{
}
void display()
{
struct node *g1;
if(start==0)
{
printf("There is no any node to display.");
}
else
{
g1=start;
while(g1->next!=start)
{
printf("%d ",g1->data);
g1=g1->next;
}
printf("%d",g1->data);
}
}
void main()
{
int ch;
printf("\n1. Insert from start");
printf("\n2. Insert from end");
printf("\n3. Insert from middle");
printf("\n4. Delete from start");
printf("\n5. Delete from end");
printf("\n6. Delete from middle");
printf("\n7. Display");
printf("\n8. Exit");
while(1)
{
printf("\nEnter Your choice:");
scanf("%d",&ch);
switch(ch)
{
case 1:
{
is();
break;
}
case 2:
{
ie();
break;
}
case 3:
{
im();
break;
}
case 4:
{
ds();
break;
}
case 5:
{
de();
break;
}
case 6:
{
dm();
break;
}
case 7:
{
display();
break;
}
case 8:
{
exit(0);
}
default:
{
printf("Wrong Input");
}
}
}
getch();
} | 3 369 |
| 3 | struct node
{
int data;
struct node*next;
};
struct node *start=0;
cn()
{
}
is()
{
}
ie()
{
}
im()
{
}
ds()
{
}
de()
{
}
dm()
{
}
display()
{
}
void main()
{
printf("\n1. Insert from start");
printf("\n2. Insert from end");
printf("\n3. Insert from middle");
printf("\n4. Delete from start");
printf("\n5. Delete from end");
printf("\n6. Delete from middle");
printf("\n7. Display");
printf("\n8. Exit");
while(1)
{
printf("\nEnter Your choice:");
scanf("%d",&ch);
switch(ch)
{
case 1:
{
is();
break;
}
case 2:
{
ie();
break;
}
case 3:
{
im();
break;
}
case 4:
{
ds();
break;
}
case 5:
{
de();
break;
}
case 6:
{
dm();
break;
}
case 7:
{
display();
break;
}
case 8:
{
exit(0);
}
default:
{
printf("Wrong Input");
}
}
}
getch();
} | 2 558 |
| 4 | struct node
{
int data;
struct node *next;
};
struct node *start=0;
struct node *cn()
{
struct node *d1;
d1=(struct node *)malloc(sizeof(struct node));
printf("Enter a data:");
scanf("%d",&d1->data);
d1->next=0;
return d1;
}
void is()
{
struct node *h1;
h1=cn();
if(start==0)
{
start=h1;
}
else
{
h1->next=start;
start=h1;
}
}
void ie()
{
struct node *t1,*h1;
t1=cn();
if(start==0)
{
start=t1;
}
else
{
h1=start;
while(h1->next!=0)
{
h1=h1->next;
}
h1->next=t1;
}
}
im()
{
}
void ds()
{
struct node *s1;
if(start==0)
{
printf("There is no any node to delete");
}
else
{
s1=start;
start=start->next;
s1->next=0;
free(s1);
}
}
void de()
{
struct node *ptr1,*ptr8;
if(start==0)
{
printf("There is no any node to delete");
}
else
{
ptr1=start;
while(ptr1->next->next!=0)
{
ptr1=ptr1->next;
}
ptr8=ptr1->next;
ptr1->next=0;
free(ptr8);
printf("Node deleted successfully");
}
}
dm()
{
}
void display()
{
struct node *p1;
if(start==0)
{
printf("There is no any node to display");
}
else
{
p1=start;
while(p1!=0)
{
printf("%d ",p1->data);
p1=p1->next;
}
}
}
void main()
{
int ch;
printf("\n1. Insert from start.");
printf("\n2. Insert from end");
printf("\n3. Insert from middle");
printf("\n4. Delete from start");
printf("\n5. Delete from end");
printf("\n6. Delete from middle");
printf("\n7. Display");
printf("\n8. Exit");
while(1)
{
printf("\nEnter your choice:");
scanf("%d",&ch);
switch(ch)
{
case 1:
{
is();
break;
}
case 2:
{
ie();
break;
}
case 3:
{
im();
break;
}
case 4:
{
ds();
break;
}
case 5:
{
de();
break;
}
case 6:
{
dm();
break;
}
case 7:
{
display();
break;
}
case 8:
{
exit(0);
}
default:
{
printf("Wrong Input.");
}
}
}
getch();
} | 2 195 |
| 5 | struct node
{
int data;
struct node *next;
};
struct node *start=0;
struct node *createNode()
{
struct node *p1;
p1=(struct node *)malloc(sizeof(struct node));
printf("Enter a data:");
scanf("%d",&p1->data);
p1->next=0;
return p1;
}
insertStart()
{
struct node *k1;
k1=createNode();
if(start==0)
{
start=k1;
}
else
{
k1->next=start;
start=k1;
}
}
insertEnd()
{
}
insertMiddle()
{
}
deleteStart()
{
struct node *i1;
if(start==0)
{
printf("There is no any node to delete");
}
else
{
i1=start;
start=start->next;
i1->next=0;
free(i1);
printf("Node deleted successfully");
}
}
deleteEnd()
{
}
deleteMiddle()
{
}
display()
{
struct node *h1;
if(start==0)
{
printf("There is no any node to display");
}
else
{
h1=start;
while(h1!=0)
{
printf("%d ",h1->data);
h1=h1->next;
}
}
}
void main()
{
int ch;
printf("\n1. Insert from start");
printf("\n2. Insert from End");
printf("\n3. Insert from Middle");
printf("\n4. Delete from start");
printf("\n5. Delete from end");
printf("\n6. Delete from middle");
printf("\n7. Display");
printf("\n8. Exit");
while(1)
{
printf("\n\nEnter your choice:");
scanf("%d",&ch);
switch(ch)
{
case 1:
{
insertStart();
break;
}
case 2:
{
insertEnd();
break;
}
case 3:
{
insertMiddle();
break;
}
case 4:
{
deleteStart();
break;
}
case 5:
{
deleteEnd();
break;
}
case 6:
{
deleteMiddle();
break;
}
case 7:
{
display();
break;
}
case 8:
{
exit(0);
}
default:
{
printf("Wrong Input");
}
}
}
getch();
} | 2 186 |
| 6 |  لا يوجد نص... | 3 409 |
| 7 | لا يوجد نص... | 3 136 |
| 8 | https://www.youtube.com/live/R6CNrpVPRqg?si=dc9Yu6EcH4NOZeDO | 3 468 |
| 9 | %d vs %i difference | VS Code Setup | Nested for loop | in C | 3 960 |
| 10 | لا يوجد نص... | 3 877 |
| 11 | https://youtube.com/playlist?list=PLZlEBHEeC6tXuF4N6QwgkI0rAL4esMNDO&si=88ff5fhRBO1qCK2Y
This is the playlist of Python Free batch.
No need to Join any free batch. | 4 120 |
| 12 | Python all Programs of free batch that we have taken on YouTube | 4 021 |
| 13 | +9 eight.py | 5 022 |
| 14 | twelth.py | 3 450 |
| 15 | login screen program in java(awt swing) | 3 552 |
| 16 | import java.awt.*;
import javax.swing.*;
import java.awt.event.*;
class Login extends JFrame
{
JLabel l1,l2,l3;
JTextField t1;
JButton b1,b2,b3;
JPasswordField t2;
Login(String s1)
{
super(s1);
}
Login()
{
}
void setComponents()
{
l1=new JLabel("Username");
l2=new JLabel("Password");
l3=new JLabel();
t1=new JTextField();
t2=new JPasswordField();
b1=new JButton("Sign In");
b2=new JButton("Clear");
b3=new JButton("Add");
setLayout(null);
l1.setBounds(100,100,120,30);
l2.setBounds(100,300,120,30);
l3.setBounds(100,600,200,30);
t1.setBounds(400,100,120,30);
t2.setBounds(400,300,120,30);
b1.setBounds(300,500,120,30);
b2.setBounds(500,500,120,30);
b3.setBounds(100,500,120,30);
add(l1);
add(l2);
add(t1);
add(t2);
add(b1);
add(l3);
add(b2);
add(b3);
b1.addActionListener(new Log());
b2.addActionListener(new Clear());
b3.addActionListener(new Add());
}
public static void main(String []args)
{
Login l1=new Login("Welcome to CoDing SeeKho");
l1.setComponents();
l1.setSize(700,700);
l1.setVisible(true);
l1.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
}
class Log implements ActionListener
{
public void actionPerformed(ActionEvent e1)
{
String s1=t1.getText();
String s2=t2.getText();
if(s1.equals("CoDing") && s2.equals("SeeKho"))
{
l3.setText("Login Successful");
}
else
{
l3.setText("Login UnSuccessful");
}
}
}
class Clear implements ActionListener
{
public void actionPerformed(ActionEvent e1)
{
t1.setText("");
t2.setText("");
}
}
class Add implements ActionListener
{
public void actionPerformed(ActionEvent e1)
{
String s1=t1.getText();
String s2=t2.getText();
int a=Integer.parseInt(s1);
int b=Integer.parseInt(s2);
int c=a+b;
l3.setText("Addition is "+c);
}
}
} | 3 604 |
| 17 | +6 Screen Shot 15-09-2023 at 17.10.png | 3 147 |
| 18 | Polish Notation- Infix to Prefix & Postfix | 2 871 |
| 19 | https://www.youtube.com/live/SJU_M83EqJA?si=6GJ_yHFkK22Z-6a3 | 4 033 |
| 20 | https://www.youtube.com/live/6m2oGZZ9HRA?feature=share | 4 330 |
