CᴏᴅɪɴɢNᴇʀᴅ 💸🐾
Open in Telegram
༗ हरे कृष्णा ༗ "Lost in my own cosmos 💫 | Coding Need Patience 🥀🐾" ❝Face the failure, Until the Failure fails to face you.❞ — Dreamer » ChikuX69.netlify.app « DM ? " @ChikuXBot " : 404;
Show more376
Subscribers
No data24 hours
-57 days
-48430 days
Data loading in progress...
Attracting Subscribers
March '25
March '25
+5
in 0 channels
February '25
+11
in 0 channels
Get PRO
January '25
+11
in 0 channels
Get PRO
December '24
+1 739
in 1 channels
| Date | Subscriber Growth | Mentions | Channels | |
| 27 March | 0 | |||
| 26 March | 0 | |||
| 25 March | 0 | |||
| 24 March | 0 | |||
| 23 March | 0 | |||
| 22 March | 0 | |||
| 21 March | 0 | |||
| 20 March | 0 | |||
| 19 March | 0 | |||
| 18 March | 0 | |||
| 17 March | 0 | |||
| 16 March | 0 | |||
| 15 March | 0 | |||
| 14 March | +1 | |||
| 13 March | 0 | |||
| 12 March | 0 | |||
| 11 March | +1 | |||
| 10 March | 0 | |||
| 09 March | +1 | |||
| 08 March | 0 | |||
| 07 March | 0 | |||
| 06 March | +1 | |||
| 05 March | 0 | |||
| 04 March | 0 | |||
| 03 March | +1 | |||
| 02 March | 0 | |||
| 01 March | 0 |
Channel Posts
| 2 | Free Star Bot 🤖
Per Refer Instant 2 STAR ⭐️
Min withdraw 15 STAR ⭐️
Earn Free Stars by Just referring to your friends 🌟 | 56 |
| 3 |  Yes, We won ❤️🥀🇮🇳😭 | 51 |
| 4 |  Source - ByteByteGo 👾 | 269 |
| 5 | def getPrint(name="world", some):
print(f"Hello {name}")
getPrint("Chiku", 55) | 229 |
| 6 | महाशिवरात्रि की हार्दिक शुभकामनाएं ❤️🙇♂ | 76 |
| 7 | console.log("abc".toLowerCase === "xyz".toLowerCase); | 242 |
| 8 | ° Figlet Design using node.js
→ First Install Node.JS in your system, if you don't have node.js!
Check This Post for Node installation (Note: Install only node, not tailwind)
→ Verify the installation using node -v command in terminal
› Now Follow these steps:-
• Open VS Code and make a separate folder, then open that folder in terminal
In terminal, do this
npm install figlet
• You will see some file and folders created, don't touch them. Simply make a JS file (example: index.js)
• Copy and paste this code in that JS file
let figlet = require('figlet');
let input = process.argv.slice(2).join(' ');
figlet(input, function (err, data) {
if (err) {
console.log("Something went wrong...");
console.dir(err);
return;
}
console.log(data);
});
• Usage: In the terminal use this command
node index.js "Your Text"
• Note: If you made your JS file with any other name then replace this index.js and use your file name.
@NotCoding | @CodesSnippet
Happy Coding 👨💻 | 291 |
| 9 |  New Junior Developers Can’t Actually Code??
Read This Blog:
https://nmn.gl/blog/ai-and-learning | 1 447 |
| 10 | print(7 > 6 > 5) | 261 |
| 11 |  Imagination..🥀 | 1 |
| 12 | -2147483648_-211224.webp | 76 |
| 13 | Completed 77 Day Of Coding ✨🎉 | 74 |
| 14 |  Day 77👾:
The n-queens puzzle is the problem of placing n queens on a (n × n) chessboard such that no two queens can attack each other. Note that two queens attack each other if they are placed on the same row, the same column, or the same diagonal.
Given an integer n, find all distinct solutions to the n-queens puzzle.
You can return your answer in any order but each solution should represent a distinct board configuration of the queen placements, where the solutions are represented as permutations of [1, 2, 3, ..., n]. In this representation, the number in the ith position denotes the row in which the queen is placed in the ith column.
For eg. below figure represents a chessboard [3 1 4 2]. | 82 |
| 15 |  🖤🕯️ | 72 |
| 16 | Hello Guyssss🥹 | 57 |
| 17 |  Day 76👾:
Implement the function power(b, e), which calculates b raised to the power of e (i.e. b^e). | 60 |
| 18 |  Day 75👾:
Given a string s, which may contain duplicate characters, your task is to generate and return an array of all unique permutations of the string. You can return your answer in any order. | 59 |
| 19 |  Day 74👾:
Design a data structure that works like a LRU Cache. Here cap denotes the capacity of the cache and Q denotes the number of queries. Query can be of two types:
PUT x y: sets the value of the key x with value y
GET x: gets the value of key x if present else returns -1.
The LRUCache class has two methods get() and put() which are defined as follows.
get(key): returns the value of the key if it already exists in the cache otherwise returns -1.
put(key, value): if the key is already present, update its value. If not present, add the key-value pair to the cache. If the cache reaches its capacity it should remove the least recently used item before inserting the new item.
In the constructor of the class the capacity of the cache should be initialized. | 52 |
| 20 |  Day 73👾:
Given the head of a linked list that may contain a loop. A loop means that the last node of the linked list is connected back to a node in the same list. The task is to remove the loop from the linked list (if it exists).
Custom Input format:
A head of a singly linked list and a pos (1-based index) which denotes the position of the node to which the last node points to. If pos = 0, it means the last node points to null, indicating there is no loop.
The generated output will be true if there is no loop in list and other nodes in the list remain unchanged, otherwise, false. | 60 |
