GeeksforGeeks
19.1K subscribers
1.66K photos
34 videos
24 files
2.63K links
Official Hub βœ…

Your coding haven – where tech meets simplicity.

Discover:
πŸ˜‚ Coding Laughter
πŸ“˜ Curated Study Material
πŸ’Ž Exclusive Offers

Utilize every service we provide and make a promise to find better opportunities for yourself! #gfgkarlohojayega!
Download Telegram
"Problem of the Day"

Solve this question to get points.

Given a string S that consists of only alphanumeric characters and dashes. The string is separated into N + 1 groups by N dashes. Also given an integer K.

Full Problem: https://bit.ly/3S38KUP
πŸ‘3πŸ₯°1
Angular is a client-side TypeScript-based front-end web framework, that helps in building attractive, steady, and utilitarian web pages and web applications.

This Angular Cheat Sheet will provide you with the content at a glance with some quick accurate ready-to-use code snippets that will help you to build a fully-functional web application.

Start learning now: https://bit.ly/3S3paN9
πŸ‘4
Did you participate in Job-a-thon 13? Here's your chance to analyze your mistakes and improve. βœ…

Join this live stream πŸ”΄at 10:30 PM IST, where Striver will provide you with the solutions and deep analysis of the Job-A-Thon 13.

To watch the live stream: https://youtu.be/EkIv4HuGGcQ
πŸ‘2
Docker is an open-source container management service and one of the most popular tools of DevOps.

It's a good practice to push your images to the docker hub profile as you don’t have to create it again and you can pull those images in your system as well as in the cloud with all your work saved in it.

With this video, let's delve into the docker concepts, learn to create a custom image, push it to the profile hub, and a lot more.

To watch the video now: https://bit.ly/3UwQ29K
πŸ‘4
Ace DSA concepts with this 04 hours live stream.

Learn everything you need to know about strings, with our in-house mentors at 10:00 PM IST only on our youtube channel.

To watch the live stream: https://www.youtube.com/watch?v=a2MTyeZS_20
πŸ‘3
So what do you think a resume requires, to grab the attention of any recruiter?

In every resume out there, you will find skills, relevant experience, and education, but what does it take to stand out from others? Well, this article is surely going to help you with it.

Here, we have listed down the best resume tips you must consider.

Check the article now: https://bit.ly/3xNqGux
Hey GEEK ARMY, 🀩

We are back with our 04th contest of CODE FESTA CHALLENGE.

Some Rules To Follow:

βœ… This is the 2nd of the fourth contest
βœ… The result will be calculated after the completion of all 4 contests every week and taking the average of all 4 contest ranks.
βœ… It is a must to participate in all 4 contests to be eligible for rewards.
βœ… The result will be calculated according to the number of questions solved in 40 minutes during the event timeline.
βœ… This is a timed contest. Do not press back during this time as your responses will not be considered.
βœ… If two people solve the same number of questions then the person who submitted earlier will on top.
βœ… You will get only one chance to submit your response.
βœ… Copying of solutions is strictly prohibited.


Starting from Today at Midnight! πŸ•›
To stay updated click on the below link

CLICK HERE: https://discord.gg/NdGvxyHG?event=1017395675606044672
πŸ‘1
Time for a self-evaluation! πŸ‘€

Know if you're placement ready with the Placement Assessment Test,✍ from 24th Sept to 25th Sept.

Also, stand a chance to get a scholarship on our Complete Interview Preparation course. 🀩

To know more in detail and Participate Now: https://bit.ly/3r99cVC
πŸ‘3
"Problem of the Day"

Solve this question to get points.

You are given a matrix of dimension n*n. All the cells are initially, zero. You are given Q queries, which contains 4 integers a b c d where (a,b) is the TOP LEFT cell and (c,d) is the Bottom Right cell of a submatrix

Full Problem: https://bit.ly/3UNZkyu
πŸ‘3❀1
Hey Geeks, πŸ‘€

We really hope that our "Introduction to Programming Languages" module helped you in starting your journey.

Now, get ready to go from basics to advanced with our "Must Do-DSA Topics" module, specially curated for beginners. 🀩

You can find all the details in this pdf like from which date πŸ“†we are going to start this module and which topic will be covered.

Don't forget to share it with your mates.🀝

To know in detail about the module: https://bit.ly/3BBgUNg
πŸ‘22πŸ”₯1
Day 1: Introduction to Arrays

An array is a collection of items of the same data type stored at contiguous memory locations. For simplicity, we can think of an array as a fleet of stairs where on each step is placed a value.

There are three types of indexing in arrays:

1) 0 (zero-based indexing)
2) 1 (one-based indexing)
3) n (N-based indexing)

Types of arrays :
1) One-dimensional array (1-D arrays)
2) Multidimensional array

To learn more about how arrays are initialized, and different operations on arrays, the advantages & disadvantages of Arrays: https://bit.ly/3rqJlZP

To delve more into Arrays, do check these out:

Arrays in C/ C++: https://bit.ly/3SA0Z8I

Arrays in Java: https://bit.ly/3xlOfKD

Arrays in Python: https://bit.ly/3RiI55g

Arrays in C#: https://bit.ly/3C794MS

Go through these topics, we'll be providing the practice problems associated with these topics real soon.
πŸ‘32πŸ”₯6❀4πŸ‘4
Must Do-DSA Topics - Day 2

Arrays Rotation: The rotation of arrays simply means to shift the array elements to the specified positions.

Let’s understand this concept with the problem using two approaches.

Given an array of integers arr[] of size N and an integer, the task is to rotate the array elements to the left by d positions.

To delve into this concept and approaches used: https://bit.ly/3BMSK2y

To practice more, check these out.

Problem 2: Program to cyclically rotate an array by one: https://bit.ly/3C9RJD0

Arrangement Rearrangement: If you’ve given an array of elements of length N, ranging from 0 to N – 1. All elements may not be present in the array. If the element is not present then there will be -1 present in the array.

Find the full problem here: https://bit.ly/3xUQVPR

To practice more,
Problem2: Rearrange positive and negative numbers with constant extra space: https://bit.ly/3LPDR3V

You can find more of these problems to understand and practice here: https://bit.ly/3xW4kqU
πŸ‘14😁1
Must Do-DSA Topics: Day 3

Order Statistics: An order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional operations beyond insertion, lookup, and deletion.

Let’s understand this concept by finding the K'th smallest/largest element in an unsorted array. Given that all array elements are distinct.

Find the implementation of the approach here: https://bit.ly/3SooxxU

Practice more with:
K’th Smallest/Largest Element using STL: https://bit.ly/3rbHebZ

Range Queries:

MO’s algorithm: The idea of MO’s algorithm is to pre-process all queries so that result of one query can be used in the next query.

To delve into this concept, let’s look into this problem with given an array and a set of query ranges: https://bit.ly/3SjUM15

Sparse Table: It is used for fast queries on a set of static data. Understand it with a practice problem: https://bit.ly/3y0BTrX

You can find more of these practice problems here: https://bit.ly/3UNBGBW
πŸ‘5πŸ”₯2