Yet to start

By registering, you agree to the Terms and Conditions & Privacy Policy of Skillenza.

Registrations will close

in 2 years

Goes live in 

Algorithms | PATHFINDING Practice (FREE)😱

Creating any solution by writing code or programs are essentially implementing algorithms using a particular programming language. So, some would say that algorithms are a good way to flush out coding ability. And coding ability is important to assess as part of interviewing a job candidate for a programming position! Isn’t it?

Understanding the core of writing/implementing algorithms and knowledge of some of the most popular and useful algorithms is vital to most companies.

Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra’s algorithm for finding the shortest path on a weighted graph.

Pathfinding is closely related to the shortest path problem, within graph theory, which examines how to identify the path that best meets some criteria (shortest, cheapest, fastest, etc) between two points in a large network.

As part of Skillenza initiative SkillDojo, your one-stop solution for learning, upskilling and advancing towards your dream career, we have excellent practice tests for you to take your skillset up a notch.👩‍💻

There are 3 stages of practice tests, 1 quiz and 2 competitive programming tests.
We recommend that you go through the created resources before you take the self-assessment tests to gauge your current capability.
Just click on the Register button and start your test.
Once you’ve finished with your self-assessment, you will be able to see your score.


If you are looking for more

If you are looking for a carefully designed curriculum with live sessions with expert mentors, and guaranteed placement with annual severance package ranging from ₹ 5 Lakhs to 30 Lakhs, and a minimum guarantee salary of ₹ 5 LPA
Join SkillDojo Pro, a 4+2 month intensive programming Bootcamp.👇
enter image description here



A bit more about competitive programming (CP)

What is competitive programming?

It’s a programming challenge with test cases and constraints. The programs are command-line ones.
The test case is a set of two files viz. Input and output. The input is directed into the program through STDIN and the output from the program is compared with the expected output. We additionally support reading from an extracted zipped folder also.

What is the scoring scheme for competitive programming?

The dashboard provides two modes viz. test and submit. Test runs your code against sample/public test cases. Submit runs against hidden/private ones. Only sample test cases and their elaborate run results are made available. We also show a line by line comparison with the expected output. For the hidden/private test cases, only we only show the exit code, passed status, time consumption, memory consumption and score. We expect users to take cues from these values.

Both the public and private test cases use the same parameters/constants (check below for information on the parameters). It’s just that using the test button will award a 0 score for the leader-board irrespective of whether or not the code passed the public test cases. It’s for debugging only.

The score is entirely dependant on the output values from the test run viz. execution time, memory consumed and program size in characters. Time elapsed since the start of the test is not a parameter as of now but we might introduce it in the future. The code judging system lets the setter set weight-ages (non-negative weight-ages to the three parameters). If the metric is only performance, a setter can set a positive weight for time and have the memory and size as zero.

The formula for a single test case given correct output is

memory_weight*(1 - memory/memory_max) + time_weight*(1 - time/time_max) + size_weight*(1 - size/size_max)

This is summed across all the test cases (each test case also has a positive weight-age) and finally normalised to 100.


Is it possible to get 100% in any test case?

Yes. If it’s a time-weighted one, because of the precision of the system, one can complete execution in 0s.

Please login to Read Discussions

  • Register for the practice tests

  • Click on View Stages

  • There are 3 stages of practice tests - 1 Quiz and 2 Competitive Programming.

  • Attempt any one or all tests, and you can view your scores on the leaderboard.

  • Happy Coding


Yes, the practice tests are available for FREE to all aspirants who want to carve their careers with their dream companies and are willing to do whatever it takes to achieve that dream.

Nothing. Nada. Zilch. Absolutely free. Because we like you. 🤩

No. However, going through this extensive preparation will certainly help you get a feel of the kind of programming questions you will be asked during interviews. Also, if you do well in all the tests, you can send us your profile, and we will pass it on to our hiring partners.

YES, this is definitely one of the best practices available to you for most of the coding interviews in major companies. And it’s always a good way to stay connected with your basics and constantly improvise on them!

If you need a carefully designed curriculum with live sessions with expert mentors, and guaranteed placement with annual severance package ranging from ₹ 5 Lakhs to 30 Lakhs, and a minimum guarantee salary of ₹ 5 LPA - Join SkillDojo Pro, a 4+2 month intensive programming Bootcamp.

Pathfinding, in a nutshell, is to find a path (usually the shortest) between two points in a network. There are many algorithms known. Some of the famous ones are Djikstra’s algorithm, A* algorithm, BFS and DFS. This Wiki article goes through these algorithms in detail, as well as some applications.


By registering, you agree to the Terms and Conditions & Privacy Policy of Skillenza.

Registrations will close

in 2 years

Evaluate Submissions

Skilldojo Prep Booster

Recommended for You

Tags

 Connected
 Not connected