
Ravindra Singh Rayal
@Ravindra_uk01
Followers
82
Following
274
Media
232
Statuses
312
Software Developer with 1 year of experience in software development lifecycle (SDLC) in developing and designing various user applications.
Joined February 2024
RT @IndianSinghh: India needs Made in India Kaveri Engine. #FundKaveriEngine . I have 78.5K followers, can you all do atleast one post on tโฆ.
0
5K
0
RT @ShaluKanwar07: ๐จ BREAKING NOW. A massive online movement is gaining momentum, #FundKaveriEngine is trending. The Kaveri Engine is Indโฆ.
0
2K
0
RT @OriginsOfIndia: Youth are quitting Islam. They ask, "Mom, if Islam values women, how come Pakistani devout Muslims raped 250,000 whiteโฆ.
0
789
0
RT @ShawnBinda: Every time India bleeds, the world is silent. But the moment we fight back?.Suddenly, weโre the aggressors. They donโt wanโฆ.
0
10K
0
Day 258 ๐ Revisiting key concepts:.๐ธ Implement Trie .๐ธ Bits: Basic Operations .๐ธ Maximum XOR of Two Numbers . Each revisit sharpens the skillset! ๐ป๐ก.#DataStructures #BitManipulation #CodingJourney
0
0
0
Day 257 ๐ Revisiting gems:.๐ธ Word Break .๐ธ Palindromic Partitioning .๐ธ Job Sequencing Problem . Every revisit uncovers new layers of understanding! ๐.#DynamicProgramming #GreedyAlgorithms #CodingJourney
0
0
1
Day 256 ๐ Revisited 3 engaging DP problems:.๐ธ Partition Equal Subset Sum .๐ธ Minimum Cost to Cut a Stick .๐ธ Egg Dropping Puzzle. DP keeps delivering incredible problem-solving insights! ๐.#DynamicProgramming #CodingLife #KeepLearning
0
0
0
Day 255 ๐ Revisited dynamic programming classics:.๐ธ Matrix Chain Multiplication.๐ธ Minimum Path Sum .๐ธ Coin Change . Each revisit strengthens my DP toolkit! ๐.#DynamicProgramming #CodingJourney #ProblemSolving
0
0
1
Day 254 ๐ Revisited these gems:.๐ธ Max Product Subarray.๐ธ Edit Distance .๐ธ Max Sum Increasing Subsequence. Every revisit refines my skills and boosts confidence! ๐ช.#CodingJourney #DynamicProgramming #100DaysOfCode
0
0
1
Day 253 ๐ Back to DP basics!.๐ธ Max Product Subarray .๐ธ Longest Increasing Subsequence .๐ธ Longest Common Subsequence . Revisiting DP classics reminds me why I love problem-solving! ๐ฅ.#DynamicProgramming #CodingJourney #100DaysOfCode.#dsa
0
0
1
Day 252 ๐ Revised classic graph algorithms! ๐.๐น Floyd-Warshall for all-pairs shortest paths.๐น MST:.Prim's Algorithm.Kruskal's Algorithm . Graphs and optimizationโperfect combo! ๐ก.#CodingJourney #GraphAlgorithms #100DaysOfCode
0
0
1
Day 251 โ
| Graphs and Greedy Strategies ๐.๐น Is Graph Bipartite? .๐น Maximum Non-Overlapping Substrings.๐น Bellman-Ford Algorithm. BFS, greedy thinking, and shortest pathsโtoday's session was enlightening! ๐ฅ.#CodingJourney #GraphTheory #100DaysOfCode #connect
1
0
1
Day 250 โ
| Graph Theory Revisited ๐.๐ Course Schedule .๐ Topological Sort .๐ Number of Islands . Deepened my understanding of topological sorting, connected components, and their applications. ๐ฅ.#CodingJourney #GraphAlgorithms #100DaysOfCode #connect
2
0
6
Day 249 โ
| Graph Traversals Revisited ๐.๐ Clone Graph .๐ DFS Traversal .๐ BFS Traversal . Strengthened concepts in DFS, BFS, and graph cloning! ๐ก.#CodingJourney #GraphTheory #ProblemSolving #connect
0
0
0
Day 248 ๐ Revised:.๐น Distinct Numbers in Window .๐น Kth Largest Element in an Array.๐น Flood Fill . Sharpening skills with every revision! ๐ก.#DSA #Algorithms #Coding #connect
0
0
6