• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Given a float number convert it into the string WITHOUT using any inbuilt Function

March 25, 2014 by Dhaval Dave

Convert a floating point number to string

Given a float number convert it into the string WITHOUT using any inbuilt Function

Method 1:

class Float2String 
{ 
   public static void main(String[] args) 
   { 
      float f=7.64f; 
      String result; 
      result=""+f; 
      System.out.println(result); 
   } 
}


-by karthik dheeraj

Method 2:

#include<stdio.h>
#include<math.h>
 
// reverses a string 'str' of length 'len'
void reverse(char *str, int len)
{
    int i=0, j=len-1, temp;
    while (i<j)
    {
        temp = str[i];
        str[i] = str[j];
        str[j] = temp;
        i++; j--;
    }
}
 
 // Converts a given integer x to string str[]. 
int intToStr(int x, char str[], int d)
{
    int i = 0;
    while (x)
    {
        str[i++] = (x%10) + '0';
        x = x/10;
    }
 
    while (i < d)
        str[i++] = '0';
 
    reverse(str, i);
    str[i] = '\0';
    return i;
}
 
// Converts a floating point number to string.
void ftoa(float n, char *res, int afterpoint)
{
    int ipart = (int)n;
 
    float fpart = n - (float)ipart;
 
    int i = intToStr(ipart, res, 0);
 
    if (afterpoint != 0)
    {
        res[i] = '.';  // add dot
 
        // Get the value of fraction part upto given no.
        fpart = fpart * pow(10, afterpoint);
 
        intToStr((int)fpart, res + i + 1, afterpoint);
    }
}
 
int main()
{
    char res[20];
    float n = 233.007;
    ftoa(n, res, 4);
    printf("\n\"%s\"\n", res);
    return 0;
}

Similar Articles

Filed Under: Amazon Interview Question, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Walmart Labs Interview Experience

Serialise Deserialise N-ary Tree

Implement a generic binary search algorithm for Integer Double String etc

Templates in C++

Leetcode: Edit Distance

Find min element in Sorted Rotated Array (Without Duplicates)

Reverse a Linked List in groups of given size

Number of Islands BFS/DFS

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Maximum sum contiguous subarray of an Array

Handle duplicates in Binary Search Tree

Amazon Interview On-Campus For Internship – 1

Printing each word reverse in string

Maximum of all subarrays of size k

Find the smallest window in a string containing all characters of another string

Longest Increasing Subsequence

Find min element in Sorted Rotated Array (With Duplicates)

LeetCode : Word Search

Sort an array according to the order defined by another array

Reliance Jio Software Developer Interview Experience

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Doubly linked list

Generate largest number arranging a no. of given non negative integer numbers

simple sql injection

How strtok() Works

Given a string, find the first character which is non-repetitive

Daughter’s Age VeryGood Puzzle

Print all nodes that are at distance k from a leaf node

Calculate price of parking from parking start end time prices

Copyright © 2026 · Genesis Framework · WordPress · Log in