## More Problems

- Number of Intervals in which given value lies
- Minimum number of times String A is repeated to such that B is substring of A
- Find numbers that are palindrome in the decimal and octal Representations
- Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].
- Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation
- Sum of distinct elements among two given sets
- Print all sub sequences of a given String
- Check if interval is covered in given coordinates

## Companies Cloud

## Tags Cloud

- software engineer 299 software development engineer (sde) 297 software engineer in test 140 software development engineer in test 129 test enginner 78 binary tree 76 difficulty level 45 misc 32 flipkart 26 stack 21 full revision 21 sorting techniques 18 qualcomm 16 quick revision 13 expressions 12 java concepts 12 uncategorized 11 scheduling/intervals 11 search algorithms 10 priority queue 9 hash table 9 backtracking 9 queue 7 greedy algorithm 7 heaps 4 leet code 3 activity selection 3 deque 3 pair 2 position 1 machine learning 1 career cup 1