Must Learn!💡

An Application Programming Interface or an API is a set of definitions and protocols through which applications communicate with each other.'

So, what is the importance of API?

The process of connecting two or more software applications or processes using APIs is referred to as API integration.

This article talks about API and all its aspects in detail. Give it a read.

Link- https://www.geeksforgeeks.org/what-is-api-integration/?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=apiintegration

Problem Of The Day
"Is it Fibonacci"

Solve the problem to win points

Geek just learned about Fibonacci numbers.

The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, ...
where the next number is found by adding up the two numbers before it.

He defines a new series called Geeky numbers. Here the next number is the sum of the K preceding numbers.
You are given an array of size K, GeekNum[ ], where the ith element of the array represents the ith Geeky number. Return its Nth term.

Note: This problem can be solved in O(N2) time complexity but the user has to solve this in O(N). The Constraints are less because there can be integer overflow in the terms.

Example 1:
Input:
N = 6, K = 1
GeekNum[] = {4}
Output:
4
Explanation:
Terms are 4, 4, 4, 4, 4, 4

Example 2:
Input:
N = 5, K = 3
GeekNum[] = {0, 1, 2}
Output:
6
Explanation:
Terms are 0, 1, 2, 3, 6.
So the 5th term is 6
Your Task:
You don't need to read input or print anything. Your task is to complete the function solve( ) which takes integer N, K, and an array GeekNum[] as input parameters and returns the Nth term of the Geeky series.

Expected Time Complexity: O(N)
Expected Space Complexity: O(N)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/202d95ecdeec659401edc63dd952b1d37b989ab8/1

Powered by hirist.com

The details of Job-A-Thon 17 is out....🙌

Nimap Infotech is hiring for Dot Net Developer.

Experience - Freshers
Location - Mumbai

Register now - https://practice.geeksforgeeks.org/jobs/nimapinfotech-donet-job-a-thon?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=jobathon

Must Learn!💡

When we choose a profession, we have a number of doubts in our mind. Becoming a full stack developer is just like that.

So, what are the requirements to become a full stack developer?

This article will a great help you in order to know the requirements of becoming a full stack developer. Give it a read.

Link- https://www.geeksforgeeks.org/requirements-to-become-a-full-stack-developer?utm_source=discord&utm_medium=marketingteam_gfgmain&utm_campaign=fullstackdeveloper

Problem Of The Day
"Apple Sequences"

Solve the problem to win points

Geek just learned about Fibonacci numbers.

There is a string of size n containing only 'A' and 'O'. 'A' stands for Apple, and 'O' stands for Orange. We have m number of spells, each spell allows us to convert an orange into an apple.

Find the longest sequence of apples you can make, given a string and the value of m.

Example 1:
Input:
N = 5
M = 1
arr[] = 'AAOAO'
Output: 4
Explanation: Changing the orange at
3rd position into an apple gives
us the maximum possible answer.

Example 2:
Input:
N = 5
M = 1
arr = 'AOOAO'
Output: 2
Explanation: Changing any orange into
an apple will give us a sequence
of length 2.

Your Task:
You don't need to read input or print anything. Your task is to complete the function appleSequence() which takes the array in the form of a string, its size n, and an integer m as input parameters and returns the largest apple sequences after converting m oranges.

Expected Time Complexity: O(n)
Expected Auxiliary Space: O(1)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/38f100615d0b2efa755e7b07f905e0f8cd2fe5df/1

Powered by hirist.com

The details of Job-A-Thon 17 is out....🙌

Avi Software is hiring for Software Developer.

Experience - Freshers
Location - Mohali

Register now - https://practice.geeksforgeeks.org/jobs/AviSoftware-SDE-Job-a-thon?

Problem Of The Day
"Fixing Two swapped nodes of a BST"

Solve the problem to win points

Two of the nodes of a Binary Search Tree (BST) are swapped. Fix (or correct) the BST by swapping them back. Do not change the structure of the tree.
Note: It is guaranteed than the given input will form BST, except for 2 nodes that will be wrong.

Example 1:
Input:
10
/ \
5 8
/ \
2 20
Output: 1
Explanation:

Example 2:
Input:
11
/ \
3 17
\ /
4 10
Output: 1
Explanation:
By swapping nodes 11 and 10, the BST
can be fixed.

Your Task:
You don't need to take any input. Just complete the function correctBst() that takes root node as parameter. The function should return the root of corrected BST. BST will then be checked by driver code and 0 or 1 will be printed.

Expected Time Complexity : O(Number of nodes)
Expected Auxiliary Space : O(logN), N = number of nodes

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/6c4053871794c5e7a0817d7eaf88d71c4bb4c2bc/1

Powered by hirist.com

Must Learn!💡
You might believe that coding careers are for math whizzes and equation nerds.

Don’t write off your chances of pursuing a profession in programming if that’s not you!

The truth is that anyone can become a coder, regardless of their expertise in mathematics.

This article talks about the topic in detail clearing all your doubts. Give it a read.

Link - https://www.geeksforgeeks.org/how-much-math-is-required-for-coding/

Problem Of The Day
"Count Cyclic Paths"

Solve the problem to win points

Given a triangular pyramid with its vertices marked as O, A, B and C and a number N, the task is to find the number of ways such that a person starting from the origin O initially, reaches back to the origin in N steps. In a single step, a person can go to any of its adjacent vertices.

Lightbox


Example 1:
Input:
N = 1
Output: 0
Explanation: The minimum length of
a cyclic path is 2.

Example 2:
Input:
N = 2
Output: 3
Explanation: The three paths are :
O-A-O, O-B-O, O-C-O

Your Task:
You don't need to read input or print anything. Your task is to complete the function countPaths() which takes an integer N as input parameter and returns the number of possible paths. Since the answer may be big, return it modulo (10^9+7).

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/aa0000a5f710ce8d41366b714341eef644ec7b82/1

Powered by hirist.com

Must Learn!💡
Java is a very successful and popular programming language.

It is very reliable and is widely used in our day-to-day lives, prominently seen in web or mobile applications.

There is much demand for Java these days and Java programmers are being recruited largely in the Information Technology sector.

This article talks about the amazing tips that every programmer should know to enhance their programming skills.

Link- https://practice.geeksforgeeks.org/jobs/VuNetSystems-Javadeveloper?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=javadeveloper

The details of Job-A-Thon 17 is out....😃🤌

Stride is hiring for Backend Developer.

Experience - 1-2 Years Location - Banglore

Register now - https://practice.geeksforgeeks.org/jobs/Stride-Inc-Backend-Developer-Job-A-Thon?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=jobathon

Problem Of The Day
"Fill the Matrix"

Solve the problem to win points

Given a matrix with dimensions N x M, entirely filled with zeroes except for one position at co-ordinates X and Y containing '1'. Find the minimum number of iterations in which the whole matrix can be filled with ones.
Note: In one iteration, '1' can be filled in the 4 neighbouring elements of a cell containing '1'.

Example 1:
Input:
N = 2, M = 3
X = 2, Y = 3
Output: 3

Explanation: 3 is the minimum possible
number of iterations in which the
matrix can be filled.

Example 2:
Input:
N = 1, M = 1
X = 1, Y = 1
Output: 0

Explanation: The whole matrix is
already filled with ones.

Your Task:
You don't need to read input or print anything. Your task is to complete the function minIterations() which takes the dimensions of the matrix N and M and the co-ordinates of the initial position of '1' ie X and Y as input parameters and returns the minimum number of iterations required to fill the matrix.


Expected Time Complexity: O(N*M)
Expected Auxiliary Space: O(1)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/2145720aebf8ea0b07f76b17217b3353a0fbea7f/1

Powered by hirist.com

Connecting talent with opportunities, 'GeeksforGeeks Jobs Fair 2023' is here.😃🤌

A range of job opportunities with your dream organizations, this is the right move to give a boost to your career.💫

Start applying now - https://practice.geeksforgeeks.org/jobs?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=jobfair2023

Problem Of The Day
"Connect Nodes at Same Level"

Solve the problem to win points

Given a binary tree, connect the nodes that are at the same level. The structure of the tree Node contains an addition nextRight pointer for this purpose.

Initially, all the nextRight pointers point to garbage values. Your function should set these pointers to point next right for each node.

10 10 ------> NULL
/ \ / \
3 5 => 3 ------> 5 --------> NULL
/ \ \ / \ \
4 1 2 4 --> 1 -----> 2 -------> NULL

Example 1:
Input:
3
/ \
1 2
Output:
3 1 2
1 3 2
Explanation:The connected tree is
3 ------> NULL
/ \
1---> 2 -----> NULL

Example 2:
Input:
10
/ \
20 30
/ \
40 60
Output:
10 20 30 40 60
40 20 60 10 30
Explanation:The connected tree is
10 ---> NULL
/ \
20---> 30 ---> NULL
/ \
40---> 60 ---> NULL
Your Task:
You don't have to read input or print anything. Complete the function connect() that takes the root of the tree as input parameter and connects the nodes that lie at the same level.

Note: The generated output will contain 2 lines. First line contains the level order traversal of the tree and second line contains the inorder traversal of the tree.


Expected Time Complexity: O(N)
Expected Auxiliary Space: O(N)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/95423710beef46bd66f8dbb48c510b2c320dab05/1

Powered by hirist.com

Must Learn!💡
The burden of hiring multiple developers or coding experts has been just eliminated with the introduction of no-code tools.

So, Why has it become so popular in the software development industry?

No code development platforms have seen a huge surge in growth during the Covid-19 pandemic.

This article will introduce you with top 10 important No-Code Development platforms. Give it a read.

Link - https://www.geeksforgeeks.org/top-10-no-code-development-platforms/?utm_source=telegram[…]ketingteam_gfgmain&utm_campaign=nocodedevelopmentplatforms

Problem Of The Day
"Unique Paths in a Grid"

Solve the problem to win points

You are given a matrix grid of n x m size consisting of values 0 and 1. A value of 1 means that you can enter that cell and 0 implies that entry to that cell is not allowed.

You start at the upper-left corner of the grid (1, 1) and you have to reach the bottom-right corner (n, m) such that you can only move in the right or down direction from every cell.

Your task is to calculate the total number of ways of reaching the target modulo (109+7).
Note: The first (1, 1) and last cell (n, m) of the grid can also be 0

Example 1:
Input:
n = 3, m = 3
grid[][] = {{1, 1, 1};
{1, 0, 1};
{1, 1, 1}}
Output:
2
Explanation:
1 1 1
1 0 1
1 1 1
This is one possible path.
1 1 1
1 0 1
1 1 1
This is another possible path.

Example 2:
Input:
n = 1, m = 3
grid = {{1, 0, 1}}
Output :
0
Explanation:
There is no possible path to reach the end.

Your Task:
You don't need to read input or print anything. Your task is to complete the function uniquePaths() which takes 2 integers n, and m, and a matrix of size n*m as input and returns the number of unique paths from cell (1,1) to (n,m) modulo (109+7)


Expected Time Complexity: O(n*m)
Expected Auxiliary Space: O(n*m)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/96161dfced02d544fc70c71d09b7a616fe726085/1

Powered by hirist.com

🚨Job Alert🚨
Centilytics is hiring for Java Developer.

Location - Noida and Bangalore
Experience - 2+ Years
Apply by - Mar 31, 2023

Apply via the following link and share the opportunity with your friends - https://practice.geeksforgeeks.org/jobs/centilytics-java-dev?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=javadev

👉Visit our jobs portal 'Get Hired With GeeksforGeeks' for more such job opportunities - https://practice.geeksforgeeks.org/jobs

👉Also, do not miss the chance to get endless opportunities at Jobs Fair 2023 - https://practice.geeksforgeeks.org/jobs?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=jobfair2023

Must Learn!💡
Technology is evolving each and every day. Every day we’re witnessing new technology advancements which are due to a variety of factors, including advances in research and development, new products and services being launched, and changes in consumer preferences and needs.

One example of how technology is changing daily is the rapid advancement of artificial intelligence (AI) and machine learning.

So, what other trends are there and how are they helpful? This article talks about the top 15 ongoing technology trends. Give it a read.

Link- https://www.geeksforgeeks.org/top-technology-trends/?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=toptechnologytrends

Problem Of The Day
"Shortest Path Using Atmost One Curved Edge"

Solve the problem to win points

Given an undirected connected graph of n vertices and list of m edges in a graph and for each pair of vertices that are connected by an edge.

There are two edges between them, one curved edge and one straight edge i.e. the tuple (x, y, w1, w2) means that between vertices x and y, there is a straight edge with weight w1 and a curved edge with weight w2.

You are given two vertices a and b and you have to go from a to b through a series of edges such that in the entire path you can use at most 1 curved edge. Your task is to find the shortest path from a to b satisfying the above condition. If there is no path from a to b, return -1.

Example 1:
Input:
n = 4, m = 4
a = 2, b = 4
edges = {{1, 2, 1, 4}, {1, 3, 2, 4},
{1, 4, 3, 1}, {2, 4, 6, 5}}
Output:
2

Explanation:
We can follow the path 2 -> 1 -> 4.
This gives a distance of 1+3 = 4 if we follow
all straight paths. But we can take the curved
path from 1 -> 4, which costs 1. This
will result in a cost of 1+1 = 2

Example 2:
Input:
n = 2, m = 1
a = 1, b = 2
edges = {{1, 2, 4, 1}}
Output :
1

Explanation:
Take the curved path from 1 to 2 which costs 1.

Your Task:
You don't need to read input or print anything. Your task is to complete the function shortestPath() which takes 4 integers n, m, a, and b, and a list of lists named edges of size m as input and returns the cost of shortest path from a to b.

Expected Time Complexity: O((m+n)log(n))
Expected Auxiliary Space: O(n+m)

Solve and submit your answer here : https://practice.geeksforgeeks.org/problems/e7d81a082cda6bd1e959d943197aa3bc21b88bdb/1

Powered by hirist.com

Must Learn!💡
The goal of digital marketing is to connect with target audiences, build brand awareness, and drive sales and engagement through digital means.

Digital marketing tools are software or platforms used to support and enhance various aspects of a digital marketing campaign.

This article will introduce you with some amazing digital marketing tools to make your work more easier. Give it a read.

Link- https://www.geeksforgeeks.org/top-10-digital-marketing-tools/?utm_source=telegram&utm_medium=marketingteam_gfgmain&utm_campaign=digitalmarketingtools