- Magnets are placed linearly, with each magnet to be considered as of point object. each magnet suffers force from its left sided magnets such that they repel it to the right and vice versa. All forces are repulsive. The force is inversely proportional to distance (1/d , d being the distance). Make a function as shown below that takes n as the number of magnets, and array of their distance from origin, which finds all the points along the linear line where net force is ZERO. Distance have to be calculated with precision of epsilon.
- Implement google’s autocorrect feature and suggest suitable data structure for it.
- Sort the elements of a stack recursively.
- Implement queue using stacks and stack using queues.
- Monty Hall Puzzle – https://betterexplained.com/articles/understanding-the-monty-hall-problem/
- Program to find amount of water in a given glass
- There is an m x n chessboard. The king is at position (i,j). What is the probability that on taking k steps, he will fall off the edge of the board.
Hint : Use recursion
- Explain ACID properties and internal implementation of ACID properties in DBMS.
- Normalization – with examples
- The probability that you cross a traffic junction in 5 minutes is p. What is the probability that you will cross it in 20 minutes?
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.