Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

Coding_knowledge

Kanalga Telegram’da o‘tish

💡 Your Coding Journey Starts Here! Get free courses, coding resources, internships, job updates & much more. Stay ahead in tech with us! ❤️🚀 Join our WhatsApp group👇 https://whatsapp.com/channel/0029Vaa7CVhCRs1rxJzy1n3D

Ko'proq ko'rsatish

Hindiston3 872Texnologiyalar & Aralashmalar1 671...

📈 Telegram kanali Coding_knowledge analitikasi

Coding_knowledge (@coding_knwledge01) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 76 942 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 1 671-o'rinni va Hindiston mintaqasida 3 872-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 76 942 obunachiga ega bo‘ldi.

09 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -1 152 ga, so‘nggi 24 soatda esa -68 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

Tasdiqlash holati: Tasdiqlanmagan
Jalb etish (ER): Auditoriya o‘rtacha 4.60% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.81% ini tashkil etuvchi reaksiyalarni to‘playdi.
Post qamrovi: Har bir post o‘rtacha 3 539 marta ko‘riladi; birinchi sutkada odatda 1 396 ta ko‘rish yig‘iladi.
Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 6 ta reaksiya keladi.
Tematik yo‘nalishlar: Kontent q&a, goody, api, stack, analyst kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“💡 Your Coding Journey Starts Here! Get free courses, coding resources, internships, job updates & much more. Stay ahead in tech with us! ❤️🚀 Join our WhatsApp group👇 https://whatsapp.com/channel/0029Vaa7CVhCRs1rxJzy1n3D”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 10 Noyabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.

76 942

Obunachilar

-6824 soatlar

-3117 kun

-1 15230 kun

3 539

Post ko'rishlar

~ 1 39624 soatlar

~ 1 99148 soatlar

4.60%

Muloqot nisbati

~ 1

Kuniga postlar

Ads index

Postlar arxiv

76 941

System Design Basics Handbook (1).pdf11.38 MB

76 941

🔸37 Toughest Interview Questions Answers 🔸.pdf1.68 MB

76 941

Manual_Testing_concepts.pdf4.67 MB

76 941

DATA STRUCTURE◾SHORT NOTES (3).pdf3.95 MB

76 941

Java Cheatsheet.pdf9.22 KB

76 941

Python Data structures (1).pdf3.10 MB

76 941

SQL Interview Questions 📕.pdf7.13 MB

76 941

Complete HTML Notes.pdf3.92 MB

76 941

Javascript Handwritten Notes .pdf5.00 MB

76 941

Java Notes (1).pdf4.92 MB

76 941

100 must do leetcode questions (1).pdf4.15 MB

76 941

No Sql (1).pdf27.55 MB

76 941

Oops Using C++ (1).pdf3.24 MB

76 941

Java Methods (1).pdf1.29 MB

76 941

Tic tac toe game import javax.swing.*; import java.awt.*; import java.awt.event.*; public class tic_tac_toe implements ActionListener { private JFrame frame; private JPanel panel; private JButton[] buttons = new JButton[9]; private boolean xTurn = true; public tic_tac_toe() { frame = new JFrame("Tic-Tac-Toe"); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); panel = new JPanel(); panel.setLayout(new GridLayout(3, 3)); panel.setBorder(BorderFactory.createEmptyBorder(10, 10, 10, 10)); for (int i = 0; i < 9; i++) { buttons[i] = new JButton(); buttons[i].setFont(new Font("Arial", Font.PLAIN, 40)); buttons[i].addActionListener(this); panel.add(buttons[i]); } frame.add(panel, BorderLayout.CENTER); frame.setSize(400, 400); frame.setVisible(true); } public void actionPerformed(ActionEvent e) { JButton button = (JButton) e.getSource(); if (xTurn) { button.setText("X"); } else { button.setText("O"); } button.setEnabled(false); xTurn = !xTurn; checkForWinner(); } public void checkForWinner() { for (int i = 0; i < 9; i += 3) { if (buttons[i].getText().equals(buttons[i + 1].getText()) && buttons[i] .getText().equals(buttons[i + 2].getText()) && !buttons[i].isEnabled()) { JOptionPane.showMessageDialog(frame, buttons[i].getText() + " wins!"); resetGame(); return; } } for (int i = 0; i < 3; i++) { if (buttons[i].getText().equals(buttons[i + 3].getText()) && buttons[i].getText().equals(buttons[i + 6].getText()) && !buttons[i].isEnabled()) { JOptionPane.showMessageDialog(frame, buttons[i] .getText() + " wins!"); resetGame(); return; } } // Check diagonals if (buttons[0].getText().equals(buttons[4].getText()) && buttons[0].getText().equals(buttons[8].getText()) && !buttons[0].isEnabled()) { JOptionPane.showMessageDialog(frame, buttons[0] .getText() + " wins!"); resetGame(); return; } if (buttons[2].getText().equals(buttons[4].getText()) && buttons[2].getText().equals(buttons[6].getText()) && !buttons[2].isEnabled()) { JOptionPane.showMessageDialog(frame, buttons[2] .getText() + " wins!"); resetGame(); return; } // Check for tie boolean tie = true; for (int i = 0; i < 9; i++) { if (buttons[i].isEnabled()) { tie = false; break; } } if (tie) { JOptionPane.showMessageDialog(frame, "Tie game!"); resetGame(); } } public void resetGame() { for (int i = 0; i < 9; i++) { buttons[i].setText(""); buttons[i].setEnabled(true); } xTurn = true; } public static void main(String[] args) { new tic_tac_toe(); } }

76 941

Java Methods.pdf1.29 MB

76 941

Java Notes .pdf4.92 MB

76 941

No Sql .pdf27.55 MB

76 941

Oops Using C++.pdf3.24 MB

76 941

100 must do leetcode questions.pdf4.15 MB