Namaste AINew
Courses
Interview PracticeHotSolve questions and prepare for your next interview.Resume BuilderNewCreate, customize, and download your resume for free.QuizzesCheck your understanding with quick quizzes.PlaygroundWrite and run code in your browser.
Sign In

Namaste AINew
Courses
Sign In

Contribute questions

{ }

< >

( )

//

[]

;;

&&

||

+=

=>

inspire.js

1

2

3

4

5

6

7

8

9

function growthMindset() {
const challenges = new Array();
  while (challenges.exist()) {
    skills.improve();
    knowledge.expand();
  }
  return 'Success guaranteed';
}
// Your potential is unlimited!

SOLUTION

O(n)

Linear Time

Learn. Practice. Succeed.

Turn your effort into offers, One problem at a time. 🚀

HTML/CSS

JavaScript

React

Node.js

Fibonacci Modulo (Pisano Period)

Compute Fibonacci numbers modulo

Shortest Distance from Source (Bellman-Ford Algorithm)

Find the shortest distance from a source node to all other nodes in a weighted directed graph using Bellman-Ford Algorithm

Kruskal's MST Algorithm

Implement Kruskal's algorithm to find the Minimum Spanning Tree (MST) of a weighted undirected graph.

Chinese Remainder Theorem

Solve systems of modular congruences using the generalized Chinese Remainder Theorem

Implement a Worker Pool that manages multiple worker threads

Implement LRUCache

Design a Least Recently Used (LRU) Cache

Create a 24 Game in React js

Filter by Company

1/3

All

spotify

oyo

nvidia

snapchat

infosys

meta

slack

twitch

stripe

google

oracle

meesho

microsoft

zomato

wipro

paypal

linkedin

flipkart

ola

NOTE: Please use a Laptop / Desktop for better experience ❤️

‹
1
18
19
20
22
›

Please Login.

Please Login.