The latest articles on DEV Community by SURENDAR K S (@surendar_sk). https://dev.to/surendar_sk https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F2416822%2F3e484976-35a8-4094-975b-19c68033191c.jpeg https://dev.to/surendar_sk en SURENDAR K S Wed, 05 Mar 2025 14:44:26 +0000 https://dev.to/surendar_sk/dsa-patterns-you-need-to-know--3k93 https://dev.to/surendar_sk/dsa-patterns-you-need-to-know--3k93 <p>After solving many DSA problems, I've noticed some key patterns that are important for coding interviews.<br><br> At the end of this article, I have also included links to some of the best LeetCode articles that I found helpful for better understanding. </p> <h2> 1. Fast and Slow Pointer </h2> <p><strong>Description</strong>: This technique uses two pointers moving at different speeds to solve problems involving cycles, such as finding the middle of a list, detecting loops, or checking for palindromes. </p> <ul> <li> <a href="https://leetcode.com/problems/linked-list-cycle-ii/" rel="noopener noreferrer">Linked List Cycle II</a> </li> <li> <a href="https://leetcode.com/problems/remove-nth-node-from-end-of-list/" rel="noopener noreferrer">Remove nth Node from the End of List</a> </li> <li> <a href="https://leetcode.com/problems/find-the-duplicate-number/" rel="noopener noreferrer">Find the Duplicate Number</a> </li> <li> <a href="https://leetcode.com/problems/palindrome-linked-list/" rel="noopener noreferrer">Palindrome Linked List</a> </li> </ul> <h2> 2. Overlapping Intervals </h2> <p><strong>Description</strong>: Intervals are often manipulated through sorting and merging based on their start and end times. </p> <ul> <li> <a href="https://leetcode.com/problems/merge-intervals/" rel="noopener noreferrer">Merge Intervals</a> </li> <li> <a href="https://leetcode.com/problems/insert-interval/" rel="noopener noreferrer">Insert Interval</a> </li> <li> <a href="https://leetcode.com/problems/my-calendar-ii/" rel="noopener noreferrer">My Calendar II</a> </li> <li> <a href="https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/" rel="noopener noreferrer">Minimum Number of Arrows to Burst Balloons</a> </li> <li> <a href="https://leetcode.com/problems/non-overlapping-intervals/" rel="noopener noreferrer">Non-overlapping Intervals</a> </li> </ul> <h2> 3. Prefix Sum </h2> <p><strong>Description</strong>: Prefix Sums/Products are techniques that store cumulative sums or products up to each index, allowing for quick subarray range queries. </p> <ul> <li> <a href="https://leetcode.com/problems/find-the-middle-index-in-array/" rel="noopener noreferrer">Find the Middle Index in Array</a> </li> <li> <a href="https://leetcode.com/problems/product-of-array-except-self/" rel="noopener noreferrer">Product of Array Except Self</a> </li> <li> <a href="https://leetcode.com/problems/maximum-product-subarray/" rel="noopener noreferrer">Maximum Product Subarray</a> </li> <li> <a href="https://leetcode.com/problems/number-of-ways-to-split-array/" rel="noopener noreferrer">Number of Ways to Split Array</a> </li> <li> <a href="https://leetcode.com/problems/range-sum-query-2d-immutable/" rel="noopener noreferrer">Range Sum Query 2D</a> </li> </ul> <h2> 4. Sliding Window </h2> <p><strong>Description</strong>: A sliding window is a subarray or substring that moves over data to solve problems efficiently in linear time. </p> <h3> Fixed Size </h3> <ul> <li> <a href="https://leetcode.com/problems/maximum-subarray/" rel="noopener noreferrer">Maximum Sum Subarray of Size K</a> </li> <li> <a href="https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/" rel="noopener noreferrer">Number of Subarrays Having Average Greater or Equal to Threshold</a> </li> <li> <a href="https://leetcode.com/problems/repeated-dna-sequences/" rel="noopener noreferrer">Repeated DNA Sequences</a> </li> <li> <a href="https://leetcode.com/problems/permutation-in-string/" rel="noopener noreferrer">Permutation in String</a> </li> <li> <a href="https://leetcode.com/problems/sliding-subarray-beauty/" rel="noopener noreferrer">Sliding Subarray Beauty</a> </li> <li> <a href="https://leetcode.com/problems/sliding-window-maximum/" rel="noopener noreferrer">Sliding Window Maximum</a> </li> </ul> <h3> Variable Size </h3> <ul> <li> <a href="https://leetcode.com/problems/longest-substring-without-repeating-characters/" rel="noopener noreferrer">Longest Substring Without Repeating Characters</a> </li> <li> <a href="https://leetcode.com/problems/minimum-size-subarray-sum/" rel="noopener noreferrer">Minimum Size Subarray Sum</a> </li> <li> <a href="https://leetcode.com/problems/subarray-product-less-than-k/" rel="noopener noreferrer">Subarray Product Less Than K</a> </li> <li> <a href="https://leetcode.com/problems/max-consecutive-ones/" rel="noopener noreferrer">Max Consecutive Ones</a> </li> <li> <a href="https://leetcode.com/problems/fruit-into-baskets/" rel="noopener noreferrer">Fruits Into Baskets</a> </li> <li> <a href="https://leetcode.com/problems/count-number-of-nice-subarrays/" rel="noopener noreferrer">Count Number of Nice Subarrays</a> </li> <li> <a href="https://leetcode.com/problems/minimum-window-substring/" rel="noopener noreferrer">Minimum Window Substring</a> </li> </ul> <h2> 5. Two Pointers </h2> <p><strong>Description</strong>: The two pointers technique involves having two different indices move through the input at different speeds to solve various array or linked list problems. </p> <ul> <li> <a href="https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/" rel="noopener noreferrer">Two Sum II - Input Array is Sorted</a> </li> <li> <a href="https://leetcode.com/problems/sort-colors/" rel="noopener noreferrer">Dutch National Flag: Sort Colors</a> </li> <li> <a href="https://leetcode.com/problems/next-permutation/" rel="noopener noreferrer">Next Permutation</a> </li> <li> <a href="https://leetcode.com/problems/bag-of-tokens/" rel="noopener noreferrer">Bag of Tokens</a> </li> <li> <a href="https://leetcode.com/problems/container-with-most-water/" rel="noopener noreferrer">Container With Most Water</a> </li> <li> <a href="https://leetcode.com/problems/trapping-rain-water/" rel="noopener noreferrer">Trapping Rain Water</a> </li> </ul> <h2> 6. Cyclic Sort (Index-Based) </h2> <p><strong>Description</strong>: Cyclic sort is an efficient approach to solving problems where numbers are consecutively ordered and must be placed in the correct index. </p> <ul> <li> <a href="https://leetcode.com/problems/missing-number/" rel="noopener noreferrer">Missing Number</a> </li> <li> <a href="https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/" rel="noopener noreferrer">Find Missing Numbers</a> </li> <li> <a href="https://leetcode.com/problems/set-mismatch/" rel="noopener noreferrer">Set Mismatch</a> </li> <li> <a href="https://leetcode.com/problems/first-missing-positive/" rel="noopener noreferrer">First Missing Positive</a> </li> </ul> <h2> 7. Reversal of Linked List (In-place) </h2> <p><strong>Description</strong>: Reversing a linked list in place without using extra space is key for problems that require in-place list manipulations. </p> <ul> <li> <a href="https://leetcode.com/problems/reverse-linked-list/" rel="noopener noreferrer">Reverse Linked List</a> </li> <li> <a href="https://leetcode.com/problems/reverse-nodes-in-k-group/" rel="noopener noreferrer">Reverse Nodes in k-Group</a> </li> <li> <a href="https://leetcode.com/problems/swap-nodes-in-pairs/" rel="noopener noreferrer">Swap Nodes in Pairs</a> </li> </ul> <h2> 8. Matrix Manipulation </h2> <p><strong>Description</strong>: Problems involving 2D arrays (matrices) are often solved using row-column traversal or manipulation based on matrix properties. </p> <ul> <li> <a href="https://leetcode.com/problems/rotate-image/" rel="noopener noreferrer">Rotate Image</a> </li> <li> <a href="https://leetcode.com/problems/spiral-matrix/" rel="noopener noreferrer">Spiral Matrix</a> </li> <li> <a href="https://leetcode.com/problems/set-matrix-zeroes/" rel="noopener noreferrer">Set Matrix Zeroes</a> </li> <li> <a href="https://leetcode.com/problems/game-of-life/" rel="noopener noreferrer">Game of Life</a> </li> </ul> <h2> 9. Merge Intervals </h2> <p><strong>Description</strong>: Problems that involve merging overlapping intervals require sorting the intervals first and then merging them based on conditions. </p> <ul> <li> <a href="https://leetcode.com/problems/merge-intervals/" rel="noopener noreferrer">Merge Intervals</a> </li> <li> <a href="https://leetcode.com/problems/interval-list-intersections/" rel="noopener noreferrer">Interval List Intersections</a> </li> <li> <a href="https://leetcode.com/problems/meeting-rooms-ii/" rel="noopener noreferrer">Meeting Rooms II</a> </li> <li> <a href="https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/" rel="noopener noreferrer">Minimum Number of Arrows to Burst Balloons</a> </li> </ul> <h2> 10. Bit Manipulation </h2> <p><strong>Description</strong>: Bitwise operations are useful for solving problems that involve binary representation, toggling bits, and checking for power-of-two numbers. </p> <ul> <li> <a href="https://leetcode.com/problems/single-number/" rel="noopener noreferrer">Single Number</a> </li> <li> <a href="https://leetcode.com/problems/number-of-1-bits/" rel="noopener noreferrer">Number of 1 Bits</a> </li> <li> <a href="https://leetcode.com/problems/power-of-two/" rel="noopener noreferrer">Power of Two</a> </li> <li> <a href="https://leetcode.com/problems/counting-bits/" rel="noopener noreferrer">Counting Bits</a> </li> </ul> <h2> 11. Backtracking </h2> <p><strong>Description</strong>: Backtracking is used to explore all possible solutions by trying out different possibilities and undoing incorrect choices. </p> <ul> <li> <a href="https://leetcode.com/problems/generate-parentheses/" rel="noopener noreferrer">Generate Parentheses</a> </li> <li> <a href="https://leetcode.com/problems/permutations/" rel="noopener noreferrer">Permutations</a> </li> <li> <a href="https://leetcode.com/problems/combination-sum/" rel="noopener noreferrer">Combination Sum</a> </li> <li> <a href="https://leetcode.com/problems/sudoku-solver/" rel="noopener noreferrer">Sudoku Solver</a> </li> </ul> <h2> 12. Dynamic Programming </h2> <p><strong>Description</strong>: DP problems involve breaking problems into smaller subproblems and using memoization or tabulation to store computed values. </p> <ul> <li> <a href="https://leetcode.com/problems/climbing-stairs/" rel="noopener noreferrer">Climbing Stairs</a> </li> <li> <a href="https://leetcode.com/problems/house-robber/" rel="noopener noreferrer">House Robber</a> </li> <li> <a href="https://leetcode.com/problems/longest-palindromic-substring/" rel="noopener noreferrer">Longest Palindromic Substring</a> </li> <li> <a href="https://leetcode.com/problems/longest-common-subsequence/" rel="noopener noreferrer">Longest Common Subsequence</a> </li> </ul> <h2> 13. Greedy Algorithms </h2> <p><strong>Description</strong>: The greedy approach involves making the best choice at each step to find the global optimum. </p> <ul> <li> <a href="https://leetcode.com/problems/jump-game/" rel="noopener noreferrer">Jump Game</a> </li> <li> <a href="https://leetcode.com/problems/gas-station/" rel="noopener noreferrer">Gas Station</a> </li> <li> <a href="https://leetcode.com/problems/assign-cookies/" rel="noopener noreferrer">Assign Cookies</a> </li> <li> <a href="https://leetcode.com/problems/partition-labels/" rel="noopener noreferrer">Partition Labels</a> </li> </ul> <h2> 14. Graphs (BFS &amp; DFS) </h2> <p><strong>Description</strong>: Graph traversal techniques like Breadth-First Search (BFS) and Depth-First Search (DFS) are widely used in problems involving paths, cycles, and connectivity. </p> <ul> <li> <a href="https://leetcode.com/problems/number-of-islands/" rel="noopener noreferrer">Number of Islands</a> </li> <li> <a href="https://leetcode.com/problems/course-schedule/" rel="noopener noreferrer">Course Schedule</a> </li> <li> <a href="https://leetcode.com/problems/word-ladder/" rel="noopener noreferrer">Word Ladder</a> </li> <li> <a href="https://leetcode.com/problems/surrounded-regions/" rel="noopener noreferrer">Surrounded Regions</a> </li> </ul> <h2> 15. Topological Sorting </h2> <p><strong>Description</strong>: Used for scheduling tasks or finding dependency orders in Directed Acyclic Graphs (DAGs). </p> <ul> <li> <a href="https://leetcode.com/problems/course-schedule-ii/" rel="noopener noreferrer">Course Schedule II</a> </li> <li> <a href="https://leetcode.com/problems/alien-dictionary/" rel="noopener noreferrer">Alien Dictionary</a> </li> <li> <a href="https://leetcode.com/problems/find-eventual-safe-states/" rel="noopener noreferrer">Find Eventual Safe States</a> </li> </ul> <h2> 16. Trie (Prefix Tree) </h2> <p><strong>Description</strong>: A Trie is a tree-like data structure used for fast searching of prefixes in words. </p> <ul> <li> <a href="https://leetcode.com/problems/implement-trie-prefix-tree/" rel="noopener noreferrer">Implement Trie (Prefix Tree)</a> </li> <li> <a href="https://leetcode.com/problems/word-search-ii/" rel="noopener noreferrer">Word Search II</a> </li> <li> <a href="https://leetcode.com/problems/replace-words/" rel="noopener noreferrer">Replace Words</a> </li> </ul> <h2> 17. Heap (Priority Queue) </h2> <p><strong>Description</strong>: Min-heaps and max-heaps are used to efficiently get the smallest/largest elements in a dataset. </p> <ul> <li> <a href="https://leetcode.com/problems/kth-largest-element-in-an-array/" rel="noopener noreferrer">Kth Largest Element in an Array</a> </li> <li> <a href="https://leetcode.com/problems/top-k-frequent-elements/" rel="noopener noreferrer">Top K Frequent Elements</a> </li> <li> <a href="https://leetcode.com/problems/find-median-from-data-stream/" rel="noopener noreferrer">Find Median from Data Stream</a> </li> <li> <a href="https://leetcode.com/problems/task-scheduler/" rel="noopener noreferrer">Task Scheduler</a> </li> </ul> <h2> 18. Union-Find (Disjoint Set) </h2> <p><strong>Description</strong>: The Union-Find data structure helps in solving problems related to connectivity and cycles in graphs. </p> <ul> <li> <a href="https://leetcode.com/problems/graph-valid-tree/" rel="noopener noreferrer">Graph Valid Tree</a> </li> <li> <a href="https://leetcode.com/problems/redundant-connection/" rel="noopener noreferrer">Redundant Connection</a> </li> <li> <a href="https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/" rel="noopener noreferrer">Number of Connected Components in an Undirected Graph</a> </li> </ul> <h2> 19. Monotonic Stack </h2> <p><strong>Description</strong>: A stack where elements are pushed or popped based on increasing or decreasing order constraints. </p> <ul> <li> <a href="https://leetcode.com/problems/next-greater-element-i/" rel="noopener noreferrer">Next Greater Element I</a> </li> <li> <a href="https://leetcode.com/problems/largest-rectangle-in-histogram/" rel="noopener noreferrer">Largest Rectangle in Histogram</a> </li> <li> <a href="https://leetcode.com/problems/daily-temperatures/" rel="noopener noreferrer">Daily Temperatures</a> </li> <li> <a href="https://leetcode.com/problems/trapping-rain-water/" rel="noopener noreferrer">Trapping Rain Water</a> </li> </ul> <h2> Conclusion </h2> <p>These patterns are fundamental for solving a variety of DSA problems efficiently. If you understand these well, you'll be well-prepared for coding interviews! 🚀 </p> <p>Also, check out these amazing LeetCode resources for further reading: </p> <ul> <li> <a href="https://neetcode.io/" rel="noopener noreferrer">NeetCode Patterns</a> </li> <li> <a href="https://leetcode.com/explore/" rel="noopener noreferrer">LeetCode Explore</a> </li> </ul> <p>Happy coding! 🎯</p> SURENDAR K S Mon, 20 Jan 2025 07:53:47 +0000 https://dev.to/surendar_sk/litigence-ai-transforming-legal-awareness-with-technology-5fjf https://dev.to/surendar_sk/litigence-ai-transforming-legal-awareness-with-technology-5fjf <p><strong>This is a submission for the <a href="https://dev.to/challenges/github">GitHub Copilot Challenge </a>: Fresh Starts</strong></p> <h2> What I Built 🚀 </h2> <p><strong>Litigence AI</strong> is a legal information platform designed to simplify access to Indian legal knowledge through advanced technology. Built with a focus on underserved communities, it provides personalized legal guidance via a conversational AI interface. </p> <h3> <em>Technical Architecture</em> 💻 </h3> <ul> <li> <strong>Frontend</strong>: Developed using Flutter for a seamless user experience, currently in closed testing on the Play Console. </li> <li> <strong>Backend</strong>: Flask-based backend hosted on Google Cloud Run ensures scalable and efficient processing. </li> <li> <strong>AI Model</strong>: Powered by a fine-tuned Vertex AI model with Google's default grounding, enhanced with custom data for improved contextual accuracy. </li> <li> <strong>Cloud Infrastructure</strong>: Firebase supports real-time web hosting and future web-based features. </li> </ul> <h3> <em>Implemented Features</em> ⭐ </h3> <ol> <li> <strong>Google &amp; OTP Authentication</strong>: Simplified and secure user access integrated via Firebase. </li> <li> <strong>Law of the Day</strong>: Educates users daily on relevant laws to foster awareness. </li> <li> <strong>Onboarding Flow &amp; Chat Interface</strong>: Smooth user onboarding and interactive legal guidance through a conversational chat system.</li> </ol> <h3> Demo 📱 </h3> <p><a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fbgebu13rvt5wr3v6fm97.png" class="article-body-image-wrapper"><img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fbgebu13rvt5wr3v6fm97.png" alt="Onboarding Screen I" width="476" height="794"></a></p> <p><a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffr7by75nouej20ebpchu.png" class="article-body-image-wrapper"><img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffr7by75nouej20ebpchu.png" alt="Auth Screen" width="477" height="795"></a></p> <p><a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzd1j1fg0jgvt7rmql5g0.png" class="article-body-image-wrapper"><img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzd1j1fg0jgvt7rmql5g0.png" alt="Otp-auth" width="477" height="795"></a><br> <a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkwonv413ttz97se78lkh.png" class="article-body-image-wrapper"><img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkwonv413ttz97se78lkh.png" alt="Chat First Screen" width="477" height="795"></a></p> <h3> Installation 📥 </h3> <p>Release Mobile App - <a href="https://github.com/surendar-05/Litigence-AI-Frontend/releases" rel="noopener noreferrer">Direct Link 🔗</a></p> <h3> Repo 📂 </h3> <div class="ltag-github-readme-tag"> <div class="readme-overview"> <h2> <img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fassets.dev.to%2Fassets%2Fgithub-logo-5a155e1f9a670af7944dd5e12375bc76ed542ea80224905ecaf878b9157cdefc.svg" alt="GitHub logo"> <a href="https://github.com/surendar-05" rel="noopener noreferrer"> surendar-05 </a> / <a href="https://github.com/surendar-05/Litigence-AI-Frontend" rel="noopener noreferrer"> Litigence-AI-Frontend </a> </h2> <h3> </h3> </div> <div class="ltag-github-body"> <div id="readme" class="md"> <div class="markdown-heading"> <h1 class="heading-element">Legal Chat App</h1> </div> <p><a href="https://flutter.dev/" rel="nofollow noopener noreferrer"><img src="https://camo.githubusercontent.com/216e3a7c7b6df6440731ba68ff3952e50be2947cadfb08e0c903c5df5f9e0041/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f506c6174666f726d2d466c75747465722d626c75652e737667" alt="Platform"></a> <a href="https://developer.android.com/" rel="nofollow noopener noreferrer"><img src="https://camo.githubusercontent.com/cbaf59bff9eac4db1763a2bea8aec8806669bd50c7a2907ceb95fff634d00204/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f506c6174666f726d2d416e64726f69642d677265656e2e737667" alt="Platform"></a></p> <p>This is a Flutter-based chat application that utilizes the Gemini API for communication.</p> <div class="markdown-heading"> <h2 class="heading-element">Project Overview</h2> </div> <p>This application provides a basic chat interface where users can send and receive messages. The Gemini API is used to handle the communication logic.</p> <div class="markdown-heading"> <h2 class="heading-element">Features</h2> </div> <ul> <li>Real-time chat functionality.</li> <li>Integration with the Gemini API.</li> <li>User authentication (using Firebase).</li> <li>Basic message display and input.</li> </ul> <div class="markdown-heading"> <h2 class="heading-element">Project Setup</h2> </div> <ol> <li> <strong>Install Flutter:</strong> If you haven't already, install Flutter by following the instructions on the official Flutter website: <a href="https://flutter.dev/docs/get-started/install" rel="nofollow noopener noreferrer">https://flutter.dev/docs/get-started/install</a> </li> <li> <strong>Clone the repository:</strong> Clone this repository to your local machine.</li> <li> <strong>Install dependencies:</strong> Navigate to the project directory and run <code>flutter pub get</code> to install the required dependencies.</li> <li> <strong>Configure Firebase:</strong> <ul> <li>Create a Firebase project and add the <code>google-services.json</code> file to the <code>android/app</code> directory.</li> <li>Enable Firebase Authentication for your project.</li> </ul> </li> <li> <strong>Set up Gemini API:</strong> <ul> <li>Configure any necessary API keys or credentials for the Gemini API within the application code (e.g., in <code>lib/services/gemini_service.dart</code>…</li> </ul> </li> </ol> </div> </div> <div class="gh-btn-container"><a class="gh-btn" href="https://github.com/surendar-05/Litigence-AI-Frontend" rel="noopener noreferrer">View on GitHub</a></div> </div> <div class="ltag-github-readme-tag"> <div class="readme-overview"> <h2> <img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fassets.dev.to%2Fassets%2Fgithub-logo-5a155e1f9a670af7944dd5e12375bc76ed542ea80224905ecaf878b9157cdefc.svg" alt="GitHub logo"> <a href="https://github.com/surendar-05" rel="noopener noreferrer"> surendar-05 </a> / <a href="https://github.com/surendar-05/Litigence-AI-Backend" rel="noopener noreferrer"> Litigence-AI-Backend </a> </h2> <h3> </h3> </div> <div class="ltag-github-body"> <div id="readme" class="md"> <div class="markdown-heading"> <h2 class="heading-element">Overview</h2> </div> <p>This application provides a Flask-based API that can be run locally or deployed in a Google Cloud environment. Below are step-by-step instructions on installing dependencies, configuring Google Cloud, running the application, and testing the API locally.</p> <div class="markdown-heading"> <h2 class="heading-element">Prerequisites</h2> </div> <ol> <li> <strong>Python 3</strong> (for running the Flask application)</li> <li> <strong>Google Cloud SDK</strong> (for Google Cloud integration)</li> <li> <strong>curl</strong> (for API testing)</li> </ol> <div class="markdown-heading"> <h2 class="heading-element">Running the Application Locally</h2> </div> <ol> <li>Clone or open the repository.</li> <li>Ensure you have installed Python dependencies (if applicable, use <code>pip install -r requirements.txt</code>).</li> <li>Run the application:</li> </ol> <div class="highlight highlight-source-shell notranslate position-relative overflow-auto js-code-highlight"> <pre>python main.py</pre> </div> <p>This starts the application at <code>http://localhost:8000</code>.</p> <div class="markdown-heading"> <h2 class="heading-element">Installing Google Cloud SDK</h2> </div> <p>Use the steps below on a Linux x86_64 machine:</p> <div class="highlight highlight-source-shell notranslate position-relative overflow-auto js-code-highlight"> <pre>curl -O https://dl.google.com/dl/cloudsdk/channels/rapid/downloads/google-cloud-cli-linux-x86_64.tar.gz tar -xf google-cloud-cli-linux-x86_64.tar.gz ./google-cloud-sdk/install.sh</pre> </div> <p>(Optional) Add the Google Cloud CLI to your PATH:</p> <div class="highlight highlight-source-shell notranslate position-relative overflow-auto js-code-highlight"> <pre><span class="pl-c"><span class="pl-c">#</span> Example approach</span> <span class="pl-c1">echo</span> <span class="pl-s"><span class="pl-pds">"</span>source ~/google-cloud-sdk/path.bash.inc<span class="pl-pds">"</span></span> <span class="pl-k">&gt;&gt;</span> <span class="pl-k">~</span>/.bashrc <span class="pl-c1">source</span> <span class="pl-k">~</span>/.bashrc</pre> </div> <p>Initialize the SDK:</p> <div class="highlight highlight-source-shell notranslate position-relative overflow-auto js-code-highlight"> <pre>./google-cloud-sdk/bin/gcloud init</pre> </div> <p>Follow the prompts to choose your Google Cloud project and configure…</p> </div> </div> <div class="gh-btn-container"><a class="gh-btn" href="https://github.com/surendar-05/Litigence-AI-Backend" rel="noopener noreferrer">View on GitHub</a></div> </div> <h3> Copilot Experience ⚡ </h3> <p>GitHub Copilot was my coding superhero! Here's how it supercharged development:</p> <ul> <li> <strong>Smart Autocomplete</strong>: Blazing-fast code generation for Flask and Flutter</li> <li> <strong>AI Pair Programming</strong>: Intelligent suggestions for complex implementations</li> <li> <strong>Error Prevention</strong>: Helped craft robust error handlers</li> <li> <strong>Testing Magic</strong>: Quick generation of comprehensive test cases</li> <li> <strong>Code Refinement</strong>: Continuous suggestions for cleaner, better code</li> </ul> <h3> GitHub Models 🤖 </h3> <p>While Litigence AI currently uses Vertex AI for its production environment (leveraging Google's grounding capabilities and Gemini's custom data integration), we're actively experimenting with GitHub Models, particularly o1, for enhanced RAG capabilities. Our testing involves comparing response accuracy and contextual understanding between different models. The results from these experiments will guide our future model selection, ensuring we deliver the most accurate and reliable legal guidance to our users. </p> <h3> Conclusion 🎯 </h3> <p>Building Litigence AI has been an incredible journey for <a class="mentioned-user" href="https://dev.to/karthidreamr">@karthidreamr</a>, transforming a personal mission into a powerful tool for social change. Through the strategic use of GitHub Copilot and cloud technologies, what started as a response to childhood observations of legal inequality is now evolving into a platform that makes legal knowledge accessible to everyone.</p> <p>The future of Litigence AI looks promising as we continue to enhance features and scale our impact. Together, we're working to ensure that legal awareness becomes a fundamental right, not a privilege! 🌟</p> devchallenge githubchallenge webdev ai